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 A134466 #4 Mar 31 2012 20:35:51 %S A134466 0,1,1,2,6,6,11,22,44,92,92,157,311,622,1239,2478,4956,9912,19832, %T A134466 19832,36217,72058,144061,288122,576123,1152239,2304478,4608943 %N A134466 See A134457. %C A134466 Note that a(n) = a(n-1) for n = [1,] 3, 6, 11, 20,... = A006127(2^k + k) (conjectured); this corresponds to the case where the string c (see A134457) satisfies c(n)="0".c(n-1) (pre-pended "0"). The next string c(n+1) is obtained by inserting "0" after the first "1" and adding 1 (except for c(4) where both of these operations are equivalent and only one must be performed). - M. F. Hasler, Dec 17 2007 %K A134466 nonn %O A134466 1,4 %A A134466 _David W. Wilson_, Dec 17 2007