login
A237120
Number of white areas in the graph of elementary cellular automaton with rule 150 at generation n.
3
0, 0, 2, 2, 2, 2, 4, 4, 2, 2, 8, 8, 4, 4, 10, 10, 2, 2, 8, 8, 8, 8, 14, 14, 4, 4, 14, 14, 10, 10, 20, 20, 2, 2, 8, 8, 8, 8, 14, 14, 8, 8, 26, 26, 14, 14, 32, 32, 4, 4, 14, 14, 14, 14, 24, 24, 10, 10, 32, 32, 20, 20, 42, 42, 2, 2, 8, 8, 8, 8, 14, 14, 8, 8, 26, 26, 14, 14, 32, 32, 8, 8, 26, 26, 26, 26, 44, 44, 14, 14, 44, 44, 32, 32, 62, 62, 4, 4, 14, 14, 14, 14, 24, 24, 14, 14, 44
OFFSET
0,3
COMMENTS
a(n) is also the number of white regions on the line at generation n of rule 150.
LINKS
Philippe Beaudoin, Python program for rule 30 (can be trivially modified for this sequence).
Eric Weisstein's World of Mathematics, Rule 150.
CROSSREFS
Cf. A071036 (rule 150), A237118 (rule 30), A237119 (rule 110).
Sequence in context: A160407 A007457 A119802 * A060369 A179004 A143979
KEYWORD
nonn
AUTHOR
Philippe Beaudoin, Feb 03 2014
STATUS
approved