Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Jun 13 2022 21:26:07
%S 1,11,111,1011,10111,101011,1010111,10101011,101010111,1010101011,
%T 10101010111,101010101011,1010101010111,10101010101011,
%U 101010101010111,1010101010101011,10101010101010111,101010101010101011,1010101010101010111,10101010101010101011
%N Binary representation of the n-th iteration of the "Rule 92" elementary cellular automaton starting with a single ON (black) cell.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H Robert Price, <a href="/A267051/b267051.txt">Table of n, a(n) for n = 0..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F Conjectures from _Colin Barker_, Jan 10 2016 and Apr 17 2019: (Start)
%F a(n) = (539+450*(-1)^n+10^(2+n))/99 for n>0.
%F a(n) = 10*a(n-1)+a(n-2)-10*a(n-3) for n>3.
%F G.f.: (1+x-100*x^3) / ((1-x)*(1+x)*(1-10*x)).
%F (End)
%t 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 Cf. A267050, A267052.
%K nonn,easy
%O 0,2
%A _Robert Price_, Jan 09 2016