|
| |
|
|
A128166
|
|
Numbers n such that n divides 1 + Sum[ Prime[k]^2, {k,1,n} ] = 1 + A024450(n).
|
|
6
| |
|
|
1, 2, 3, 4, 6, 9, 12, 13, 26, 28, 45, 66, 174, 308, 350, 366, 417, 783, 804, 3774, 5714, 7998, 17628, 17940, 63447, 67620, 83028, 137868, 216717, 297486, 425708, 659316, 674166, 883500, 1203786, 3605052, 6778607, 9516098, 19964862, 25338586, 27771732, 70980884, 91871891, 208234138
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
MATHEMATICA
| s = 1; Do[s = s + Prime[n]^2; If[ Mod[s, n] == 0, Print[n]], {n, 700000}] (* From Alexander Adamchuk *)
Select[Range[10^4], IntegerQ[(1 + Plus@@(Prime[Range[#]]^2))/#] &] (* From Alonso del Arte, Jan 20 2011 *)
|
|
|
CROSSREFS
| Cf. A000040, A024450, A111441, A128165, A128167, A128168, A128169, A128170, A128171.
Sequence in context: A035947 A048249 A018471 * A112249 A204502 A062437
Adjacent sequences: A128163 A128164 A128165 * A128167 A128168 A128169
|
|
|
KEYWORD
| hard,nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 22 2007, Feb 23 2007
|
|
|
EXTENSIONS
| More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Jan 20 2011
|
| |
|
|
