|
%I #21 Feb 01 2016 05:23:32
%S 1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,
%T 1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,
%U 1,0,1,1,1,0,1,1,1,0,1,1,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 246".
%C Row n has length 2n+1.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; Chapter 3.
%H Robert Price, <a href="/A071041/b071041.txt">Table of n, a(n) for n = 0..10000</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="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 The first ten rows:
%e 1
%e 1 1 1
%e 1 0 1 1 1
%e 1 1 1 0 1 1 1
%e 1 0 1 1 1 0 1 1 1
%e 1 1 1 0 1 1 1 0 1 1 1
%e 1 0 1 1 1 0 1 1 1 0 1 1 1
%e 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
%e 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
%e 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1
%K nonn,tabf
%O 0,1
%A _Hans Havermann_, May 26 2002
%E Corrected by _Hans Havermann_, Jan 07 2012
|
