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 A266846 #21 Feb 16 2025 08:33:28
%S A266846 1,6,20,104,336,1696,5440,27264,87296,436736,1397760,6989824,22368256,
%T A266846 111845376,357908480,1789558784,5726601216,28633071616,91625881600,
%U A266846 458129670144,1466015154176,7330076819456,23456246661120,117281237499904,375299963355136
%N A266846 Decimal representation of the n-th iteration of the "Rule 70" elementary cellular automaton starting with a single ON (black) cell.
%D A266846 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H A266846 Robert Price, <a href="/A266846/b266846.txt">Table of n, a(n) for n = 0..1000</a>
%H A266846 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A266846 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A266846 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A266846 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F A266846 Conjectures from _Colin Barker_, Jan 05 2016 and Apr 18 2019: (Start)
%F A266846 a(n) = 2^(n-1)*(-(-2)^n+9*2^n-2)/3 = 2^(n-1)*A061547(n+3).
%F A266846 a(n) = 2*a(n-1)+16*a(n-2)-32*a(n-3) for n>2.
%F A266846 G.f.: (1+4*x-8*x^2) / ((1-2*x)*(1-4*x)*(1+4*x)).
%F A266846 (End)
%t A266846 rule=70; rows=20; ca=CellularAutomaton[rule,{{1},0},rows-1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rows-k+1,rows+k-1}],{k,1,rows}]; (* Truncated list of each row *) Table[FromDigits[catri[[k]],2],{k,1,rows}] (* Decimal Representation of Rows *)
%Y A266846 Cf. A266843, A266844.
%K A266846 nonn,easy
%O A266846 0,2
%A A266846 _Robert Price_, Jan 04 2016