Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

COMMENT

No other terms up to 10^8. - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2007

MATHEMATICA

s = 0; t = {}; Do[s = s + Prime[n]^8; If[ Mod[s, n] == 0, AppendTo[t, n]], {n, 1000000}]; t

CROSSREFS

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

Adjacent sequences: A125825 A125826 A125827 this_sequence A125829 A125830 A125831

Sequence in context: A060485 A081795 A091748 this_sequence A116139 A087529 A050525

KEYWORD

bref,hard,more,nonn

AUTHOR

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

EXTENSIONS

One more term from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research