A334499 For 0 <= R <= 255, let s(R,n) = eventual period of a single cell in a Rule R cellular automaton operating in a cyclic universe of width n; a(n) = max_R s(R,n).
2, 2, 6, 8, 30, 18, 126, 40, 504, 430, 979, 102, 819, 2198, 6820, 6016, 78812, 7812, 183920, 142580, 352884, 122870, 1630792, 185040, 2777040, 312156, 81688176, 304913, 463347935, 5921860, 1211061438, 26636800, 3315517623, 40012662, 24752893585, 135322524, 40583131393, 535150200, 132932362849, 3936823600
Offset: 1
Keywords
Examples
For R = 45, the sequence {s(R,1)..s(R,10)} is 2,2,1,2,30,18,126,2,504,430 (see A334508), and s(45,10) = 430 is the greatest value of any s(R,10), and a(10) = 430.
References
- Bradley Klee, Posting to Math Fun Mailing List, Apr 26 2020.
Links
- Bert Dobbelaere, C++ program
- Bradley Klee, Table giving R, then {s(R,1)..s(R,10)} for 0 <= R <= 255
- Index entries for sequences related to cellular automata
Formula
a(n) <= A357950(n). Equality holds for all n <= 35, except n = 12, 13, 23, 24, 25, 26, 28, 34. - Pontus von Brömssen, Nov 09 2022
Extensions
More terms from Bert Dobbelaere, May 09 2020