A003598 -id:A003598

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

Search: a003598 -id:a003598

Displaying 21-21 of 21 results found.

page 1 2 3

A056739

Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.

+10
0

1, 5, 11, 25, 55, 121, 125, 275, 365, 605, 625, 925, 1331, 1375, 2365, 3025, 3125, 6655, 6875, 14641, 15125, 15625, 22625, 27565, 32125, 33275, 34375, 73205, 75625, 78125, 123365, 161051, 166375, 171875, 366025, 378125, 390625, 541717, 660605

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

Contains A003598. In general n=p^iq^i => n|Sum[k=1..2p, k^n], where p, q=2p+1 prime (see Meyer ref).

LINKS

Table of n, a(n) for n=1..39.

C. Meyer, On a conjecture arising from the OEIS

MATHEMATICA

Do[ If[ Mod[ PowerMod[ 10, n, n ] + PowerMod[ 9, n, n ] + PowerMod[ 8, n, n ] + PowerMod[ 7, n, n ] + PowerMod[ 6, n, n ] + PowerMod[ 5, n, n ] + PowerMod[ 4, n, n ] + PowerMod[ 3, n, n ] + PowerMod[ 2, n, n ] + 1, n ] == 0, Print[ n ] ], {n, 1, 10^6} ]

Select[Range[700000], Divisible[Total[Range[10]^#], #]&] (* Harvey P. Dale, Nov 24 2014 *)

Select[Range[700000], Mod[Total[PowerMod[Range[10], #, #]], #]==0&] (* Harvey P. Dale, Feb 23 2023 *)

CROSSREFS

Cf. A001557.

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Aug 25 2000

STATUS

approved

page 1 2 3

Search completed in 0.011 seconds