Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128169
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128169 Numbers n such that n divides 1 + Sum[ Prime[k]^5, {k,1,n} ] = 1 + A122103(n). +0
7
1, 2, 4, 6, 10, 12, 22, 58, 155, 363, 464, 665, 1146, 2870, 3048, 4019, 5931, 8724, 21503, 50439, 67560, 476281, 705570, 4050684, 6956459, 7443590, 10449928, 10799546, 15385564, 17735139 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A000040, A122103, A122142, A128165, A128166, A128167, A128168, A128170, A128171.

Sequence in context: A074645 A125286 A045963 this_sequence A095923 A094960 A032396

Adjacent sequences: A128166 A128167 A128168 this_sequence A128170 A128171 A128172

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research