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,2

Comments

For a guide to related sequences, see A204892.

Links

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

Mathematica

(See the program at A204916.)

Crossrefs

Cf. A204916, A204908, A204900, A204892.

Sequence in context: A257993 A055881 A332202 * A232098 A055874 A195155

Adjacent sequences: A204914 A204915 A204916 * A204918 A204919 A204920

Keyword

nonn

Author

Clark Kimberling, Jan 20 2012

Status

approved