Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125907
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125907 Numbers n such that n divides Sum[ Prime[k]^4, {k,1,n} ]. +0
13
1, 2951, 38266951 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

a(1) = 1; s = 2^4; Do[s = s + Prime[2n]^4+Prime[2n+1]^4; If[ Mod[s, 2n+1] == 0, Print[2n+1]], {n, 1, 20000000}]

CROSSREFS

Cf. A085450, A122142, A122103, A098999, A007504, A045345, A024450, A111441, A122102, A122140.

Sequence in context: A068290 A096628 A051024 this_sequence A025514 A054833 A054212

Adjacent sequences: A125904 A125905 A125906 this_sequence A125908 A125909 A125910

KEYWORD

bref,hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.003 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 November 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research