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 A160411 #38 Sep 01 2023 08:17:40
%S A160411 1,8,4,28,8,52,12,76,16,100,20,124,24,148,28,172,32,196,36,220,40,244,
%T A160411 44,268,48,292,52,316,56,340,60,364,64,388,68,412,72,436,76,460,80,
%U A160411 484,84,508,88,532,92,556,96
%N A160411 Number of cells turned "ON" at n-th stage of A160117.
%C A160411 First differences of A160117.
%C A160411 It appears that one of the bisections is A008574. - _Omar E. Pol_, Sep 20 2011
%H A160411 Paolo Xausa, <a href="/A160411/b160411.txt">Table of n, a(n) for n = 1..10000</a>
%H A160411 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 A160411 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A160411 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,2,0,-1).
%F A160411 G.f.: x*(x^2+1)*(4*x^3 + x^2 + 8*x + 1) / ((x-1)^2*(x+1)^2). - _Colin Barker_, Mar 04 2013
%F A160411 From _Colin Barker_, Apr 06 2013: (Start)
%F A160411 a(n) = -11 - 9*(-1)^n + (7 + 5*(-1)^n)*n for n > 2.
%F A160411 a(n) = 2*a(n-2) - a(n-4) for n > 6. (End)
%t A160411 LinearRecurrence[{0,2,0,-1},{1,8,4,28,8,52},100] (* _Paolo Xausa_, Sep 01 2023 *)
%Y A160411 Cf. A139251, A160117, A160411, A160413, A160415.
%K A160411 nonn,easy
%O A160411 1,2
%A A160411 _Omar E. Pol_, Jun 13 2009
%E A160411 a(10)-a(27) from _Omar E. Pol_, Mar 26 2011
%E A160411 More terms from _Colin Barker_, Apr 06 2013