OFFSET
0
COMMENTS
Row n has length 2n+1.
This sequence is also generated by Rule 35.
LINKS
Robert Price, Table of n, a(n) for n = 0..9999
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
EXAMPLE
The first ten rows:
1
1 0 0
0 0 0 1 0
1 1 1 1 0 0 1
0 0 0 0 0 0 1 0 0
1 1 1 1 1 1 1 0 0 1 1
0 0 0 0 0 0 0 0 0 1 0 0 0
1 1 1 1 1 1 1 1 1 1 0 0 1 1 1
0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0
1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 1 1
Including leading and trailing 0's and 1's, the pattern is as follows:
00000000000000100000000000000
11111111111111001111111111111
00000000000000010000000000000
11111111111111100111111111111
00000000000000001000000000000
11111111111111110011111111111
00000000000000000100000000000
11111111111111111001111111111
00000000000000000010000000000
11111111111111111100111111111
00000000000000000001000000000
11111111111111111110011111111
00000000000000000000100000000
11111111111111111111001111111
- R. J. Mathar, Aug 07 2025
MATHEMATICA
rule = 3; rows = 20; Flatten[Table[Take[CellularAutomaton[rule, {{1}, 0}, rows-1, {All, All}][[k]], {rows - k + 1, rows + k - 1}], {k, 1, rows}]]
CROSSREFS
KEYWORD
nonn,tabf,easy
AUTHOR
Robert Price, Dec 20 2015
STATUS
approved
