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 A246336 #27 Mar 06 2015 22:45:24 %S A246336 1,4,9,16,21,32,49,64,69,80,97,116,137,176,225,256,261,272,289,308, %T A246336 329,368,417,452,473,512,565,624,705,832,961,1024,1029,1040,1057,1076, %U A246336 1097,1136,1185,1220,1241,1280,1333,1392,1473,1600,1729,1796,1817,1856,1909,1968,2049,2176 %N A246336 Partial sums of A151548. %C A246336 Arises in the analysis of a certain 2-D cellular automaton (see A169707). %C A246336 a(46) = 1729 is also the Hardy-Ramanujan number. - _Omar E. Pol_, Feb 17 2015 %C A246336 It appears that sums of two successive terms give the numbers greater than 1 in A194811. - _Omar E. Pol_, Mar 05 2015 %H A246336 N. J. A. Sloane, <a href="/A246336/b246336.txt">Table of n, a(n) for n = 0..10000</a> %H A246336 N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a> %H A246336 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %F A246336 G.f.: 1/(1-x^2) + (4*x/(1-x))*mul(1+x^(2^k-1)+2*x^(2^k),k=1..oo). %F A246336 From _Omar E. Pol_, Feb 18 2015: (Start) %F A246336 It appears that: %F A246336 a(2^k-2) = (2^k-1)^2, if k >= 1. %F A246336 a(2^k-1) = 4^k, if k >= 1. %F A246336 a(2^k) = 4^k + 5, if k >= 1. %F A246336 (End) %Y A246336 Cf. A169707, A151548, A160552, A170903. %K A246336 nonn,look %O A246336 0,2 %A A246336 _N. J. A. Sloane_, Aug 30 2014