|
%I #32 Aug 27 2021 02:16:51
%S 1,4,8,9,121,343,484,676,1331,10201,12321,14641,40804,44944,69696,
%T 94249,698896,1002001,1030301,1234321,1367631,4008004,5221225,6948496,
%U 100020001,102030201,104060401,121242121,123454321,125686521,400080004,404090404,522808225,617323716,942060249
%N Palindromic perfect powers.
%C Up to 10^12, there are only 43 perfect powers which are palindromic.
%C The sequence is infinite, for instance it contains (10^k+1)^2. - _Emmanuel Vantieghem_, Sep 29 2017
%C Conjecture: there are no palindromic perfect powers with prime exponent > 3. - _Chai Wah Wu_, Aug 26 2021
%H Chai Wah Wu, <a href="/A075786/b075786.txt">Table of n, a(n) for n = 1..2001</a> (n = 1..176 from Michael S. Branicky, n = 177..504 from David A. Corneth)
%e 343 = 7^3 is a term as it is a palindrome and a perfect power. - _David A. Corneth_, Mar 23 2021
%t a = {}; Do[q = IntegerDigits[n]; p = FromDigits[ Join[ q, Reverse[ Drop[q, -1]]]]; If[ Apply[ GCD, Last[ Transpose[ FactorInteger[p]]]] > 1, a = Append[a, p]]; p = FromDigits[ Join[ q, Reverse[q]]]; If[ Apply[ GCD, Last[ Transpose[ FactorInteger[p]]]] > 1, a = Append[a, p]], {n, 1, 10^5}]
%o (Python)
%o from math import isqrt
%o def ispal(n): s = str(n); return s == s[::-1]
%o def athrough(digits):
%o found, limit = {1}, 10**digits
%o for k in range(2, isqrt(limit) + 1):
%o kpow = k*k
%o while kpow < limit:
%o if ispal(kpow): found.add(kpow)
%o kpow *= k
%o return sorted(found)
%o print(athrough(9)) # _Michael S. Branicky_, Mar 23 2021
%Y Cf. A001597, A002113, A076443.
%K nonn,base
%O 1,2
%A _Zak Seidov_, Oct 10 2002
%E Edited and extended by _Robert G. Wilson v_, Oct 11 2002
%E More terms from _David A. Corneth_, Mar 24 2021
%E b-file corrected and extended by _Chai Wah Wu_, Aug 26 2021
|
