{"url":"https://jeneshicc.hatenadiary.org/entry/20081027/1225118244","title":"Problem 14","version":"1.0","categories":["Project Euler","Haskell"],"author_url":"https://blog.hatena.ne.jp/jeneshicc/","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081027%2F1225118244\" title=\"Problem 14 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"description":"The following iterative sequence is defined for the set of positive integers:n n/2 (n is even) n 3n + 1 (n is odd)Using the rule above and starting with 13, we generate the following sequence: 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 \u2026","author_name":"jeneshicc","provider_url":"https://hatena.blog","height":"190","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","width":"100%","blog_url":"https://jeneshicc.hatenadiary.org/","published":"2008-10-27 23:37:24","provider_name":"Hatena Blog"}