This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A058993 #17 Apr 02 2023 10:40:49
%S A058993 1,3,26,36,43,66,76,149,511,885,3767,18157,20516,26316
%N A058993 Numbers m such that 5^m reversed is a prime.
%t A058993 Do[ If[ PrimeQ[ ToExpression[ StringReverse[ ToString[5^n] ] ] ], Print[n] ], {n, 1, 3000} ]
%o A058993 (Python)
%o A058993 from sympy import isprime
%o A058993 k, m, A058993_list = 1, 5, []
%o A058993 while k <= 10**3:
%o A058993 if isprime(int(str(m)[::-1])):
%o A058993 A058993_list.append(k)
%o A058993 k += 1
%o A058993 m *= 5 # _Chai Wah Wu_, Mar 09 2021
%o A058993 (PARI) isok(m) = isprime(fromdigits(Vecrev(digits(5^m)))) \\ _Mohammed Yaseen_, Jul 20 2022
%Y A058993 Cf. A059206, A071583.
%Y A058993 Numbers m such that k^m reversed is prime: A057708 (k=2), A350441 (k=4), this sequence (k=5), A058994 (k=7), A350442 (k=8), A058995 (k=13).
%K A058993 nonn,base,more
%O A058993 1,2
%A A058993 _Robert G. Wilson v_, Jan 17 2001
%E A058993 a(12)-a(14) from _Michael S. Branicky_, Apr 01 2023