A334500 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) is the nearest integer to max_R s(R,n)/n (rounded down in case of ties).
2, 1, 2, 2, 6, 3, 18, 5, 56, 43, 89, 8, 63, 157, 455, 376, 4636, 434, 9680, 7129, 16804, 5585, 70904, 7710, 111082, 12006, 3025488, 10890, 15977515, 197395, 39066498, 832400, 100470231, 1176843, 707225531, 3758959, 1096841389, 14082900, 3408522124, 98420590
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), so a(10) = 430/10 = 430.
References
- Bradley Klee, Posting to Math Fun Mailing List, Apr 26 2020
Links
- Bradley Klee, Table giving R, then {s(R,1)..s(R,10)} for 0 <= R <= 255
Extensions
a(11)-a(40) (based on data in A334499) from Pontus von Brömssen, Oct 15 2022
Comments