{"id":25305640,"url":"https://github.com/pedrokehl/collatz","last_synced_at":"2025-04-07T05:46:34.996Z","repository":{"id":225896555,"uuid":"248607647","full_name":"pedrokehl/collatz","owner":"pedrokehl","description":"Algorithm to calculate the Collatz sequence (Zero dependencies)","archived":false,"fork":false,"pushed_at":"2020-03-19T21:33:57.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-13T09:53:28.277Z","etag":null,"topics":["collatz","javascript"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/pedrokehl.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2020-03-19T21:22:07.000Z","updated_at":"2020-08-28T17:15:11.000Z","dependencies_parsed_at":"2024-03-04T21:41:57.278Z","dependency_job_id":"f4ee1149-355d-4a1d-bb5c-80627d99a5ad","html_url":"https://github.com/pedrokehl/collatz","commit_stats":null,"previous_names":["pedrokehl/collatz"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedrokehl%2Fcollatz","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedrokehl%2Fcollatz/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedrokehl%2Fcollatz/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/pedrokehl%2Fcollatz/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/pedrokehl","download_url":"https://codeload.github.com/pedrokehl/collatz/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247601482,"owners_count":20964863,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["collatz","javascript"],"created_at":"2025-02-13T09:53:31.114Z","updated_at":"2025-04-07T05:46:34.978Z","avatar_url":"https://github.com/pedrokehl.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Collatz Sequence Algorithm\n\nThis repository ships an implementation for the following question:\n\n**Which starting number, under one million, produces the longest chain on the Collatz Sequence?**\n\nCollatz:\n- The iterative sequence is defined for the set of positive integers\n- Given a number n in the Collatz sequence,\n  - if n is even, the next number in the sequence is n/2\n  - if n is odd, the next number in the sequence is 3n + 1\n- Applying the rule above with the starting number 13, we generate the following sequence:\n  - 13 40 20 10 5 16 8 4 2 1 It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpedrokehl%2Fcollatz","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpedrokehl%2Fcollatz","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpedrokehl%2Fcollatz/lists"}