|
|
A071033
|
|
a(n) = n-th state of cellular automaton generated by "Rule 94" when started with a single ON cell.
|
|
3
|
|
|
1, 111, 11011, 1110111, 110101011, 11101010111, 1101010101011, 111010101010111, 11010101010101011, 1110101010101010111, 110101010101010101011, 11101010101010101010111, 1101010101010101010101011, 111010101010101010101010111, 11010101010101010101010101011
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) has length 2n+1.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Rule 94
|
|
FORMULA
|
Conjecture: a(n) = floor((1099*100^n + 9090)/990) + 1 for odd n > 1; a(n) = floor((1090*100^n + 10)/990) + 1 for even n > 1. - Karl V. Keller, Jr., Oct 25 2021
|
|
MATHEMATICA
|
rule=94; 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 *) Table[FromDigits[catri[[k]]], {k, 1, rows}] (* Binary Representation of Rows *) (* Robert Price, Feb 21 2016 *)
|
|
CROSSREFS
|
This sequence, A118101 and A118102 are equivalent descriptions of the Rule 94 automaton.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|