Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131275 Numbers n such that n divides Sum_{k=1..n} (Prime_k)^15. +0
10
1, 17, 25, 31, 1495, 5555, 8185, 8647, 106841, 187329, 345377, 1811351, 2179119, 2863775, 6368703, 10250821, 59137893 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

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

Cf. A045345, A111441, A122140, A125907, A122142, A125825, A125826, A125828, A131263, A131264, A125827, A131272, A131273, A131274, A131276, A131277, A131278, A131279, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.

Sequence in context: A105448 A082130 A140609 this_sequence A129910 A034963 A120143

Adjacent sequences: A131272 A131273 A131274 this_sequence A131276 A131277 A131278

KEYWORD

more,nonn,less

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007

EXTENSIONS

a(12)-a(17) from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 02 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research