The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A335296 Least index a(n) such that the sequences b(n,m) from A334539 are purely periodic after a(n). 1
1, 1, 1, 1, 1, 1, 16, 24, 70, 31, 98, 112, 116, 170, 216, 488, 2012, 795, 328, 219, 2993, 4486, 1555, 814, 3575, 12296, 18386, 29659, 13665, 2162, 47685, 52346, 69061, 447927, 472933, 33798, 857812, 179171, 47447, 1195784, 332172, 618783, 248092, 3947618, 2718980, 15924182, 2857983, 3536883, 8606700 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
COMMENTS
By the pigeonhole principle, a(n) is upper bounded by n^n - n.
LINKS
Reddit user supermac30, Foggy Sequences.
EXAMPLE
The sequence b(3, m) is 1, 1, 2, 1, 2, 2, 2, 3, 1, 1, 2, ... which is periodic at index 1 with period 8.
The sequence b(8, m) is 1, 1, 2, 1, 3, 1, 4, ... 3, 4, 1, 2, 3, 3, 4, 2, 2, 3, 3, 4, 2, 3, 3, 4, 2, 2, 3, 3, ... which is periodic at index 24 with period 9.
PROG
(Python)
def a(n):
b = [1];
for i in range(2, n+1):
b.append(b.count(b[-1]));
prev = {tuple(b):1};
m = 1;
while(True):
b.append(b.count(b[-1]));
del b[0];
m += 1;
if(tuple(b) in prev):
return prev[tuple(b)]
else:
prev[tuple(b)] = m;
CROSSREFS
Cf. A334539.
Sequence in context: A204696 A024588 A334229 * A358447 A120468 A166629
KEYWORD
nonn
AUTHOR
Elad Michael, May 30 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 12:26 EDT 2024. Contains 372600 sequences. (Running on oeis4.)