|
| |
|
|
A071036
|
|
Triangle read by rows giving successive states of cellular automaton generated by "Rule 150" when started with a single ON cell.
|
|
7
|
|
|
|
1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
Row n has length 2n+1.
Also the coefficients of (x^2 + x + 1)^n mod 2. - Alan DenAdel, Mar 19 2014
|
|
|
REFERENCES
|
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; Chapter 3.
|
|
|
LINKS
|
Robert Price, Table of n, a(n) for n = 0..9999
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
S. Wolfram, A New Kind of Science
Index to Elementary Cellular Automata
Index entries for sequences related to cellular automata
|
|
|
FORMULA
|
a(n) = A027907(n) modulo 2. - Michel Marcus, Mar 20 2014
|
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1, 1;
1, 0, 1, 0, 1;
1, 1, 0, 1, 0, 1, 1;
1, 0, 0, 0, 1, 0, 0, 0, 1;
1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1;
... - Michel Marcus, Mar 20 2014
|
|
|
PROG
|
(PARI) rown(n) = Vec(lift((x^2 + x + 1)^n * Mod(1, 2))); \\ Michel Marcus, Mar 20 2014
|
|
|
CROSSREFS
|
Cf. A027907.
This sequence, A038184 and A118110 are equivalent descriptions of the Rule 150 automaton.
Sequence in context: A122895 A114592 A140653 * A071038 A131522 A144473
Adjacent sequences: A071033 A071034 A071035 * A071037 A071038 A071039
|
|
|
KEYWORD
|
nonn,tabf
|
|
|
AUTHOR
|
Hans Havermann, May 26 2002
|
|
|
EXTENSIONS
|
Corrected by Hans Havermann, Jan 08 2012
|
|
|
STATUS
|
approved
|
| |
|
|
