[go: up one dir, main page]

login
A100053
Maximum run of white (or OFF) cells in generation n of the Rule 30 elementary cellular automaton.
10
0, 0, 2, 1, 3, 1, 4, 2, 5, 3, 4, 4, 3, 2, 4, 2, 6, 4, 4, 3, 5, 4, 4, 3, 5, 5, 4, 3, 4, 4, 4, 5, 8, 6, 5, 3, 5, 4, 5, 3, 5, 5, 5, 9, 7, 5, 11, 9, 7, 6, 8, 6, 4, 7, 5, 3, 5, 6, 5, 4, 4, 5, 5, 3, 14, 12, 10, 8, 6, 5, 4, 7, 5, 6, 4, 6, 4, 4, 6, 4, 6, 7, 5, 5, 4, 4, 11, 9, 7, 6, 4, 6, 7, 5, 7, 5, 8, 6, 5
OFFSET
0,3
LINKS
EXAMPLE
From Michael De Vlieger, Oct 06 2015: (Start)
First 12 rows, replacing "1" with ".", ignoring "0" outside of range of 1's, for better visibility of OFF cells, maximum number of contiguous OFF cells in each row appears at left:
0 .
0 . . .
2 . . 0 0 .
1 . . 0 . . . .
3 . . 0 0 . 0 0 0 .
1 . . 0 . . . . 0 . . .
4 . . 0 0 . 0 0 0 0 . 0 0 .
2 . . 0 . . . . 0 0 . . . . . .
5 . . 0 0 . 0 0 0 . . . 0 0 0 0 0 .
3 . . 0 . . . . 0 . . 0 0 . 0 0 0 . . .
4 . . 0 0 . 0 0 0 0 . 0 . . . . 0 . . 0 0 .
4 . . 0 . . . . 0 0 . . 0 . 0 0 0 0 . 0 . . . .
3 . . 0 0 . 0 0 0 . . . 0 0 . . 0 0 . . 0 . 0 0 0 .
(End)
MATHEMATICA
clip[lst_] := Block[{p = Flatten@ Position[lst, 1]}, Take[lst, {Min@ p, Max@ p}]]; Max /@ Map[Length@ # &, Map[Split@ # &, Map[clip, CellularAutomaton[30, {{1}, 0}, 98]]] /. 1 -> Nothing, {2}] (* Michael De Vlieger, Oct 06 2015 *)
CellularAutomaton[30, {{1}, 0}, 100];
(Reverse[Internal`DeleteTrailingZeros[
Reverse[Internal`DeleteTrailingZeros[#]]]]) & /@ %;
Table[(Length /@ Select[%[[i]] // Split, Total[#] == 0 &] // Max), {i,
1, % // Length}] /. -\[Infinity] -> 0 (* Philipp O. Tsvetkov, Sep 25 2018 *)
CROSSREFS
Sequence in context: A371092 A124072 A189357 * A029194 A246582 A059499
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Oct 31 2004
STATUS
approved