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

A114980
Numbers k such that (j^k + k^j) == 0 (mod k+j), j=5 case.
6
1, 3, 5, 7, 14, 15, 19, 20, 21, 23, 25, 26, 35, 45, 50, 55, 65, 73, 95, 105, 115, 119, 120, 125, 145, 165, 185, 195, 215, 225, 245, 270, 275, 285, 295, 305, 325, 350, 365, 385, 405, 425, 435, 437, 465, 495, 525, 527, 545, 585, 595, 605, 620, 621, 645
OFFSET
1,2
LINKS
PROG
(PARI) isok(k, j=5) = (j^k+k^j) % (k+j) == 0; \\ Michel Marcus, Oct 10 2013
(PARI) isok(k, j=5) = Mod(j, k+j)^k+Mod(k, k+j)^j == 0; \\ Michel Marcus, Aug 07 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Feb 22 2006
EXTENSIONS
More terms from Michel Marcus, Oct 10 2013
STATUS
approved