A204917 Least j such that n divides s(k)-s(j) for some k>j, where s(j)=(prime(j))^2.

1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 3, 7, 3, 1, 4, 1, 2, 1, 4, 1, 3, 1, 5, 2, 4, 11, 4, 1, 2, 1, 5, 1, 3, 1, 7, 13, 3, 1, 8, 1, 4, 15, 9, 1, 2, 1, 7, 1, 4

Offset: 1

Author

Clark Kimberling, Jan 20 2012

Keywords

• nonn

Comments

For a guide to related sequences, see A204892.

Crossrefs

Cf. A204916, A204908, A204900, A204892.

Programs

Mathematica

(See the program at A204916.)