{"id":16565109,"url":"https://github.com/shonharsh/python-fibonacci","last_synced_at":"2026-04-07T08:32:38.796Z","repository":{"id":245605568,"uuid":"818739094","full_name":"ShonHarsh/Python-Fibonacci","owner":"ShonHarsh","description":"A Python Fobonacci code exercies","archived":false,"fork":false,"pushed_at":"2024-06-22T18:18:28.000Z","size":26,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-20T05:53:07.034Z","etag":null,"topics":["academic","artificial-intelligence","atom","automation","bot","config","education","fibonacci","git","guide","learning","markdown","process","python","recursion","studio","testing","training-materials","trending","windows"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ShonHarsh.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-06-22T18:07:34.000Z","updated_at":"2025-02-07T00:57:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"00faf0cc-bbe5-44d0-9577-e59eadd932fb","html_url":"https://github.com/ShonHarsh/Python-Fibonacci","commit_stats":null,"previous_names":["shonharsh/python-fibonacci"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ShonHarsh/Python-Fibonacci","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShonHarsh%2FPython-Fibonacci","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShonHarsh%2FPython-Fibonacci/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShonHarsh%2FPython-Fibonacci/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShonHarsh%2FPython-Fibonacci/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ShonHarsh","download_url":"https://codeload.github.com/ShonHarsh/Python-Fibonacci/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ShonHarsh%2FPython-Fibonacci/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31506562,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-07T03:10:19.677Z","status":"ssl_error","status_checked_at":"2026-04-07T03:10:13.982Z","response_time":105,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["academic","artificial-intelligence","atom","automation","bot","config","education","fibonacci","git","guide","learning","markdown","process","python","recursion","studio","testing","training-materials","trending","windows"],"created_at":"2024-10-11T20:46:07.058Z","updated_at":"2026-04-07T08:32:38.767Z","avatar_url":"https://github.com/ShonHarsh.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"![Banner](Data/Images/GitHub-Python-Banner.png)\n\n### Fibonacci Sequence\n\nIn mathematics, the [Fibonacci Sequence](https://en.wikipedia.org/wiki/Fibonacci_sequence) is a sequence in which each number is the\nsum of the two preceding ones.\n\nThis is a code exercise and I solve it in two ways.\n1. The first method is a while loop.  This prints all the digits up to the input number.\n2. The second method is using recursion.  This prints the n'th number.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshonharsh%2Fpython-fibonacci","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshonharsh%2Fpython-fibonacci","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshonharsh%2Fpython-fibonacci/lists"}