# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a267159
Showing 1-1 of 1

%I A267159 #14 Apr 19 2019 07:10:40
%S A267159 1,2,5,10,16,24,31,44,50,65,73,94,100,123,131,160,166,197,205,242,248,
%T A267159 287,295,340,346,393,401,454,460,515,523,584,590,653,661,730,736,807,
%U A267159 815,892,898,977,985,1070,1076,1163,1171,1264,1270,1365,1373,1474,1480
%N A267159 Total number of ON (black) cells after n iterations of the "Rule 107" elementary cellular automaton starting with a single ON (black) cell.
%D A267159 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
%H A267159 Robert Price, <a href="/A267159/b267159.txt">Table of n, a(n) for n = 0..1000</a>
%H A267159 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A267159 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A267159 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A267159 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%F A267159 Conjectures from _Colin Barker_, Jan 11 2016 and Apr 19 2019: (Start)
%F A267159 a(n) = a(n-1)+a(n-2)-a(n-3)+a(n-4)-a(n-5)-a(n-6)+a(n-7) for n>12.
%F A267159 G.f.: (1+x+2*x^2+4*x^3+2*x^4+2*x^5-x^6+x^7-4*x^8-x^9+x^10+x^11-x^12) / ((1-x)^3*(1+x)^2*(1+x^2)).
%F A267159 (End)
%t A267159 rule=107; rows=20; ca=CellularAutomaton[rule,{{1},0},rows-1,{All,All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]],{rows-k+1,rows+k-1}],{k,1,rows}]; (* Truncated list of each row *) nbc=Table[Total[catri[[k]]],{k,1,rows}]; (* Number of Black cells in stage n *) Table[Total[Take[nbc,k]],{k,1,rows}] (* Number of Black cells through stage n *)
%Y A267159 Cf. A267152.
%K A267159 nonn,easy
%O A267159 0,2
%A A267159 _Robert Price_, Jan 11 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE