|
%I #27 Jan 30 2016 14:39:21
%S 1,1,1,1,1,0,0,0,1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,1,
%T 1,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,0,
%U 0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 22".
%C Row n has length 2n+1.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; Chapter 3.
%H Michael De Vlieger, <a href="/A071029/b071029.txt">Table of n, a(n) for n = 0..10000</a>
%H Michael De Vlieger, <a href="/A071029/a071029.png">Illustration of first 256 generations</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>
%e From _Michael De Vlieger_, Oct 05 2015: (Start)
%e First 8 rows, replacing "0" with "." for better visibility of ON cells:
%e 1
%e 1 1 1
%e 1 . . . 1
%e 1 1 1 . 1 1 1
%e 1 . . . . . . . 1
%e 1 1 1 . . . . . 1 1 1
%e 1 . . . 1 . . . 1 . . . 1
%e 1 1 1 . 1 1 1 . 1 1 1 . 1 1 1
%e 1 . . . . . . . . . . . . . . . 1
%e (End)
%t clip[lst_] := Block[{p = Flatten@ Position[lst, 1]}, Take[lst, {Min@ p, Max@ p}]]; clip /@ CellularAutomaton[22, {{1}, 0}, 9] // Flatten (* _Michael De Vlieger_, Oct 05 2015 *)
%Y For number of ON cells see A071044.
%K nonn,tabf
%O 0,1
%A _Hans Havermann_, May 26 2002
%E Corrected by _Hans Havermann_, Jan 07 2012
|
