login
A204917
Least j such that n divides s(k)-s(j) for some k>j, where s(j)=(prime(j))^2.
1
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.
MATHEMATICA
(See the program at A204916.)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jan 20 2012
STATUS
approved