|
%I #30 Jul 27 2023 15:37:15
%S 1,1,1,1,1,1,1,0,1,1,1,1,0,0,1,1,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,0,0,
%T 1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,1,0,
%U 1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 158".
%C Row n has length 2n+1.
%H Robert Price, <a href="/A071037/b071037.txt">Table of n, a(n) for n = 0..9999</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule158.html">Rule 158</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H Stephen Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>, Wolfram Media, 2002; Chapter 3.
%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%e 1;
%e 1, 1, 1;
%e 1, 1, 1, 0, 1;
%e 1, 1, 1, 0, 0, 1, 1;
%e 1, 1, 1, 0, 1, 1, 1, 0, 1;
%e ...
%t A071037list[rowmax_]:=MapIndexed[ArrayPad[#1, #2-rowmax-1]&,CellularAutomaton[158,{{1},0},rowmax]];A071037list[10] (* Generates 11 rows *) (* _Paolo Xausa_, Jul 27 2023 *)
%Y Cf. A118171 (rows decimal), A265379 (rows binary), A265381 (central column decimal), A265380 (central column binary).
%K nonn,tabf
%O 0,1
%A _Hans Havermann_, May 26 2002
%E Corrected by _Hans Havermann_, Jan 07 2012
|
