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 A265284 #16 Feb 16 2025 08:33:27
%S A265284 1,4,8,14,20,28,36,46,56,68,80,94,108,124,140,158,176,196,216,238,260,
%T A265284 284,308,334,360,388,416,446,476,508,540,574,608,644,680,718,756,796,
%U A265284 836,878,920,964,1008,1054,1100,1148,1196,1246,1296,1348,1400,1454
%N A265284 Total number of ON (black) cells after n iterations of the "Rule 94" elementary cellular automaton starting with a single ON (black) cell.
%D A265284 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H A265284 Robert Price, <a href="/A265284/b265284.txt">Table of n, a(n) for n = 0..999</a>
%H A265284 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A265284 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A265284 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F A265284 Conjectures from _Colin Barker_, Dec 07 2015 and Apr 16 2019: (Start)
%F A265284 a(n) = (2*n^2+12*n-(-1)^n+1)/4 for n>0.
%F A265284 a(n) = (n^2+6*n)/2 for n>1 and even.
%F A265284 a(n) = (n^2+6*n+1)/2 for n odd.
%F A265284 a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n>4.
%F A265284 G.f.: (1+2*x-x^4) / ((1-x)^3*(1+x)).
%F A265284 (End)
%t A265284 rule = 94; rows = 30; Table[Total[Take[Table[Total[Table[Take[CellularAutomaton[rule,{{1},0},rows-1,{All,All}][[k]],{rows-k+1,rows+k-1}],{k,1,rows}][[k]]],{k,1,rows}],k]],{k,1,rows}]
%Y A265284 Cf. A118102.
%K A265284 nonn,easy
%O A265284 0,2
%A A265284 _Robert Price_, Dec 06 2015