A355602 a(1) = 61. For n > 1, a(n) = smallest prime q such that q^(a(n-1)-1) == 1 (mod a(n-1)^2).

61, 601, 2269, 13499, 58313, 1950827, 57480139, 713589493, 4722480517

Offset

1,1

Comments

Is this overall an increasing sequence or does it enter a cycle?

Links

Table of n, a(n) for n=1..9.

Prog

(PARI) seq(start, terms) = my(x=start, i=1); print1(start, ", "); while(1, forprime(q=1, , if(Mod(q, x^2)^(x-1)==1, print1(q, ", "); x=q; i++; if(i >= terms, break({2}), break))))
seq(61, 20) \\ Print initial 20 terms of sequence

Crossrefs

Row n = 18 of A249162.

Cf. A355597, A355598, A355599, A355600, A355601.

Sequence in context: A209548 A302898 A234926 * A069595 A235009 A304764

Adjacent sequences: A355599 A355600 A355601 * A355603 A355604 A355605

Keyword

nonn,hard,more

Author

Felix Fröhlich, Jul 09 2022

Status

approved