%I #28 Jun 26 2023 14:36:48

%S 1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,1,0,0,1,1,1,1,1,0,1,1,1,1,0,

%T 1,1,1,0,0,1,0,0,0,0,1,0,0,1,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,0,0,0,

%U 0,0,1,1,1,0,0,0,1,0,0,1,1,1,1,1,0,0,0,1,0,0,1,1,0,1,1,1,1,0,1

%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 86".

%C Row n has length 2n+1.

%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; Chapter 3.

%H Reinhard Zumkeller, <a href="/A071032/b071032.txt">Rows n = 0..120 of triangle, flattened</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule30.html">Rule 30</a>

%H S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>

%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>

%F T(n,k) = A070950(n,2*n+1-k), 0 <= k <= 2*n+1. - _Reinhard Zumkeller_, Jun 08 2013

%t A071032list[rowmax_]:=MapIndexed[ArrayPad[#1,#2-rowmax-1]&,CellularAutomaton[86,{{1},0},rowmax]];A071032list[10] (* Generates 11 rows *) (* _Paolo Xausa_, Jun 01 2023 *)

%o (Haskell)

%o a071032 n k = a071032_tabf !! n !! k

%o a071032_row n = a071032_tabf !! n

%o a071032_tabf = map reverse a070950_tabf

%o -- _Reinhard Zumkeller_, Jun 08 2013

%Y Cf. A005408 (row lengths), A070952 (row sums), A051023 (central terms), A070950 (mirror image, rule 30), A226464 (complemented, rule 149).

%K nonn,tabf

%O 0,1

%A _Hans Havermann_, May 26 2002

%E Corrected by _Hans Havermann_, Jan 07 2012