Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

MATHEMATICA

s = 0; Do[s = s + Prime[n]^7; If[ Mod[s, n] == 0, Print[n]], {n, 25000}]

CROSSREFS

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

Adjacent sequences: A125823 A125824 A125825 this_sequence A125827 A125828 A125829

Sequence in context: A104593 A046910 A138246 this_sequence A033981 A023113 A056047

KEYWORD

hard,more,nonn

AUTHOR

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

EXTENSIONS

More terms from Ryan Propper (rpropper(AT)stanford.edu), Mar 26 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