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 A267051 #24 Feb 16 2025 08:33:29
%S A267051 1,11,111,1011,10111,101011,1010111,10101011,101010111,1010101011,
%T A267051 10101010111,101010101011,1010101010111,10101010101011,
%U A267051 101010101010111,1010101010101011,10101010101010111,101010101010101011,1010101010101010111,10101010101010101011
%N A267051 Binary representation of the n-th iteration of the "Rule 92" elementary cellular automaton starting with a single ON (black) cell.
%D A267051 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H A267051 Robert Price, <a href="/A267051/b267051.txt">Table of n, a(n) for n = 0..1000</a>
%H A267051 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A267051 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A267051 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A267051 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F A267051 Conjectures from _Colin Barker_, Jan 10 2016 and Apr 17 2019: (Start)
%F A267051 a(n) = (539+450*(-1)^n+10^(2+n))/99 for n>0.
%F A267051 a(n) = 10*a(n-1)+a(n-2)-10*a(n-3) for n>3.
%F A267051 G.f.: (1+x-100*x^3) / ((1-x)*(1+x)*(1-10*x)).
%F A267051 (End)
%t A267051 rule=92; 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]]],{k,1,rows}] (* Binary Representation of Rows *)
%Y A267051 Cf. A267050, A267052.
%K A267051 nonn,easy
%O A267051 0,2
%A A267051 _Robert Price_, Jan 09 2016