login
A266982
Triangle read by rows giving successive states of cellular automaton generated by "Rule 81" initiated with a single ON (black) cell.
4
1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1
OFFSET
0
COMMENTS
Row n has length 2n+1.
This sequence is also generated by rule 113.
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.
FORMULA
Conjecture: a(0)=1; for n>0, a(n) = ( Sum_{i=1..n-2} floor((n-2)/i) ) mod 2. - Wesley Ivan Hurt, Mar 22 2016
EXAMPLE
The first ten rows:
1
0 0 1
1 1 0 0 0
0 0 1 1 1 1 1
1 1 0 0 0 0 0 0 0
0 0 1 1 1 1 1 1 1 1 1
1 1 0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
The full writeup, including leading and trailing 0's and 1's, gives the following pattern:
00000000000000100000000000000
11111111111110011111111111111
00000000000011000000000000000
11111111111001111111111111111
00000000001100000000000000000
11111111100111111111111111111
00000000110000000000000000000
11111110011111111111111111111
00000011000000000000000000000
11111001111111111111111111111
00001100000000000000000000000
- R. J. Mathar, Aug 07 2025
MATHEMATICA
rule=81; rows=20; ca=CellularAutomaton[rule, {{1}, 0}, rows-1, {All, All}]; (* Start with single black cell *) catri=Table[Take[ca[[k]], {rows-k+1, rows+k-1}], {k, 1, rows}]; (* Truncated list of each row *) Flatten[catri] (* Triangle Representation of CA *)
CROSSREFS
Sequence in context: A188398 A288929 A285083 * A364746 A051341 A057211
KEYWORD
nonn,tabf,easy
AUTHOR
Robert Price, Jan 07 2016
STATUS
approved