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

37, 691, 19181, 5849, 18503, 37853, 478741, 18401827, 571007279, 5860639859

Offset

1,1

Comments

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

The sequence decreases for the first time at n = 4.

Links

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

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(37, 20) \\ Print initial 20 terms of sequence

Crossrefs

Row n = 12 of A249162.

Cf. A355597, A355598, A355599, A355601, A355602.

Sequence in context: A338003 A104180 A010953 * A161650 A162165 A162389

Adjacent sequences: A355597 A355598 A355599 * A355601 A355602 A355603

Keyword

nonn,hard,more

Author

Felix Fröhlich, Jul 09 2022

Status

approved