|
%I #23 Oct 26 2015 09:18:20
%S 1,3,4,6,7,9,15,16,24,25,27,29,34,36,37,39,41,43,48,49,51,54,55,58,60,
%T 63,64,66,69,70,72,74,77,79,80,82,84,86,90,91,93,100,103
%N Largest number (up to that point) of consecutive rightmost black cells in the rows of Rule 30 (begun from an initial black cell). a(n) = b(2^n), where b(m) is sequence A094603.
%C The natural number n appears a(n)-a(n-1) times in A094606.
%C The number of contiguous black or ON cells, rightmost or otherwise, includes the terms {10, 11}. Row 42 contains 10 contiguous ON cells right of center, row 45 contains 11 contiguous ON cells left of center. Are these the only instances of contiguous ON cells that set records that are not rightmost? - _Michael De Vlieger_, Oct 06 2015
%D Wolfram, Stephen, A New Kind of Science, Wolfram Media, 2002.
%H Eric Rowland, <a href="http://www.complex-systems.com/abstracts/v16_i03_a04.html">Local nested structure in rule 30</a>, Complex Systems 16 (2006) 239-258.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Rule30.html">Rule 30</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%e From _Michael De Vlieger_, Oct 06 2015: (Start)
%e First 12 rows, replacing "0" with ".", ignoring "0" outside of range of
%e 1's, for better visibility of ON cells, the number of contiguous
%e rightmost ON cells of each row appears at left:
%e 1 1
%e 3 1 1 1
%e 1 1 1 . . 1
%e 4 1 1 . 1 1 1 1
%e 1 1 1 . . 1 . . . 1
%e 3 1 1 . 1 1 1 1 . 1 1 1
%e 1 1 1 . . 1 . . . . 1 . . 1
%e 6 1 1 . 1 1 1 1 . . 1 1 1 1 1 1
%e 1 1 1 . . 1 . . . 1 1 1 . . . . . 1
%e 3 1 1 . 1 1 1 1 . 1 1 . . 1 . . . 1 1 1
%e 1 1 1 . . 1 . . . . 1 . 1 1 1 1 . 1 1 . . 1
%e 4 1 1 . 1 1 1 1 . . 1 1 . 1 . . . . 1 . 1 1 1 1
%e 1 1 1 . . 1 . . . 1 1 1 . . 1 1 . . 1 1 . 1 . . . 1
%e Thus the sequence starts with {1, 3, 4, 6, ...} as these set new records for the number of contiguous rightmost ON cells in each row.
%e (End)
%t t = Length /@ Map[Last, Split /@ CellularAutomaton[30, {{1}, 0}, 6000] /. 0 -> Nothing /. {} -> Nothing]; a = {0}; Do[If[t[[n]] > Max@ a, AppendTo[a, t[[n]]]], {n, Length@ t}]; Rest@ a (* _Michael De Vlieger_, Oct 06 2015 *)
%Y Cf. A094603, A094605, A094606.
%K nonn,more
%O 0,2
%A _Eric Rowland_, May 13 2004; revised Aug 10 2005
%E More terms from _Eric Rowland_, Jan 21 2006
%E a(42) from _Eric Rowland_, Jul 03 2015
|
