OFFSET
1,2
COMMENTS
By definition, the present sequence is a subsequence of A082576.
For each integer r >= 2 this sequence contains 10^r + 1.
All terms > 1 end in 01, 25, 49, 51, 57, 75, 76, or 93.
EXAMPLE
51 is a term since 51 is a 2-digit number and 51^51 == 5051 (mod 10^4) and thus 51^51 == 51 (mod 10^(2 + 1)).
PROG
(PARI) for (len_m = 1, 5, for (m = 10^(len_m - 1), 10^len_m - 1, if (m == Mod(m, 10^(len_m + 1))^m, print1(m, ", "))))
(Python)
from itertools import count
def A373205_gen(): # generator of terms
for i in count(0, 100):
for j in (1, 25, 49, 51, 57, 75, 76, 93):
m = i+j
if pow(m, m, 10*10**(len(str(m)))) == m:
yield m
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Marco Ripà, May 27 2024
STATUS
approved