This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A268710 #6 Feb 13 2016 23:17:37 %S A268710 1,2,3,4,6,9,15,25,41,75,134,246,428,802,1454,2643,4588,8851,16849, %T A268710 32368,60504,117343 %N A268710 Number of iterations of A268395 needed to reach zero from 2^n + 1: a(n) = A268708(2^n + 1). %F A268710 a(n) = A268708((2^n)+1). %o A268710 (Scheme) (define (A268710 n) (A268708 (+ 1 (A000079 n)))) %Y A268710 Cf. A000051, A268395, A268708, A268709. %K A268710 nonn,more %O A268710 0,2 %A A268710 _Antti Karttunen_, Feb 11 2016