|
%I #26 Sep 01 2020 06:25:26
%S 1,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,
%T 1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,0,
%U 1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,0,1
%N Binary representation of n-th iteration of the Rule 190 elementary cellular automaton starting with a single black cell.
%C Row n has length 2*n+1. - _Hans Havermann_, May 26 2002
%H Robert Price, <a href="/A118111/b118111.txt">Table of n, a(n) for n = 0..9999</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule190.html">Rule 190</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>
%e From _Michael De Vlieger_, Aug 21 2020: (Start)
%e Irregular array begins:
%e 0: 1
%e 1: 1 1 1
%e 2: 1 1 1 0 1
%e 3: 1 1 1 0 1 1 1
%e 4: 1 1 1 0 1 1 1 0 1
%e 5: 1 1 1 0 1 1 1 0 1 1 1
%e 6: 1 1 1 0 1 1 1 0 1 1 1 0 1
%e 7: 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
%e 8: 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1
%e 9: 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
%e ... (End)
%t With[{nn = 9}, MapIndexed[#1[[#2 + 1 ;; 2 nn - #2 + 1]] & @@ {#1, nn - First[#2] + 1} &, CellularAutomaton[190, {{1}, 0}, nn]]] // Flatten (* _Michael De Vlieger_, Aug 21 2020 *)
%Y Cf. A265688 (binary rows), A037576 (decimal rows), A032766 (num 1's).
%K nonn,tabf
%O 0,1
%A _Eric W. Weisstein_, Apr 13 2006
|
