login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128166 Numbers n such that n divides 1 + Sum[ Prime[k]^2, {k,1,n} ] = 1 + A024450(n). 91
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, 231967260, 238066596, 289829748, 784027092, 1078515812, 33256634230 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(51) > 5.3*10^10. - Robert Price, Dec 16 2013

LINKS

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

OEIS Wiki, Sums of powers of primes divisibility sequences

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))/#] &] (* Alonso del Arte, Jan 20 2011 *)

CROSSREFS

Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n.

Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.

Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Sequence in context: A318759 A018471 A240307 * A240470 A112249 A204502

Adjacent sequences:  A128163 A128164 A128165 * A128167 A128168 A128169

KEYWORD

hard,nonn

AUTHOR

Alexander Adamchuk, Feb 22 2007, Feb 23 2007

EXTENSIONS

More terms from Sean A. Irvine, Jan 20 2011

a(45)-a(50) from Robert Price, Dec 16 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 07:00 EDT 2019. Contains 324183 sequences. (Running on oeis4.)