Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128171
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128171 Numbers n such that n divides 1 + Sum[ Prime[k]^7, {k,1,n} ]. +0
7
1, 2, 4, 5, 6, 10, 12, 46, 1830, 2086, 6000, 7681, 8242, 15204, 43698, 52054, 154490, 211052, 392767, 4309540, 6452151, 8773101 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

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

CROSSREFS

Cf. A000041, A125826, A128165, A128166, A128167, A128168, A128169, A128170.

Sequence in context: A128167 A162534 A127092 this_sequence A039036 A043045 A091678

Adjacent sequences: A128168 A128169 A128170 this_sequence A128172 A128173 A128174

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