login

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”).

A045599
Numbers k that divide 10^k + 5^k.
1
1, 3, 5, 9, 15, 25, 27, 45, 55, 75, 81, 125, 135, 165, 171, 225, 243, 275, 375, 405, 495, 513, 605, 625, 675, 729, 825, 855, 1125, 1215, 1375, 1485, 1539, 1815, 1875, 2025, 2187, 2475, 2565, 3025, 3125, 3249, 3375, 3645, 4125, 4275, 4455, 4617, 4965, 5445
OFFSET
1,2
LINKS
MATHEMATICA
Select[Range[5500], Mod[PowerMod[10, #, #] +PowerMod[5, #, #], #]==0 &] (* G. C. Greubel, Dec 12 2022 *)
PROG
(Magma) [n: n in [1..5500] | (Modexp(10, n, n) + Modexp(5, n, n)) mod n eq 0 ]; // G. C. Greubel, Dec 12 2022
(SageMath) [n for n in (1..5500) if (power_mod(10, n, n)+power_mod(5, n, n))%n==0 ] # G. C. Greubel, Dec 12 2022
(PARI) is(n)=(Mod(10, n)^n+Mod(5, n)^n==0);
for(n=1, 5500, if(is(n), print1(n, ", "))); \\ Joerg Arndt, Dec 13 2022
CROSSREFS
Sequence in context: A178961 A147509 A057259 * A045604 A057251 A015965
KEYWORD
nonn
STATUS
approved