Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128166
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128166 Numbers n such that n divides 1 + Sum[ Prime[k]^2, {k,1,n} ] = 1 + A024450(n). +0
7
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 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

s = 1; Do[s = s + Prime[n]^2; If[ Mod[s, n] == 0, Print[n]], {n, 700000}]

CROSSREFS

Cf. A000040, A024450, A111441, A128165, A128167, A128168, A128169, A128170, A128171.

Sequence in context: A035947 A048249 A018471 this_sequence A112249 A062437 A060729

Adjacent sequences: A128163 A128164 A128165 this_sequence A128167 A128168 A128169

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 22 2007, Feb 23 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research