|
%I #23 Jan 30 2016 14:39:43
%S 1,1,0,1,1,0,0,0,1,1,0,1,0,1,0,1,1,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,
%T 0,1,1,0,0,0,1,0,0,0,1,0,0,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,0,
%U 0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0
%N Triangle read by rows giving successive states of cellular automaton generated by "Rule 90".
%C If either neighbor is 1 then new state is 1, otherwise new state is 0.
%C Row n has length 2n+1.
%C Rules #18, #26, #82, #90, #146, #154, #210, #218 all give rise to this sequence. - Hans Havermann
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 25.
%H Robert Price, <a href="/A070886/b070886.txt">Table of n, a(n) for n = 0..9999</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule90.html">Rule 90</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 1; 1,0,1; 1,0,0,0,1; 1,0,1,0,1,0,1; ...
%t rows = 10; ca = CellularAutomaton[90, {{1}, 0}, rows-1]; Flatten[ Table[ca[[k, rows-k+1 ;; rows+k-1]], {k, 1, rows}]] (* _Jean-François Alcover_, May 24 2012 *)
%Y Cf. A070950, A070887. Alternate rows of A047999. Interpreted as binary numbers: A038183. Interpreted as Zeckendorf-expansions: A048757. Drawn as binary trees: A080263.
%K nonn,tabf,nice,easy
%O 0,1
%A _N. J. A. Sloane_, May 19 2002
%E More terms from _Hans Havermann_, May 26 2002
|
