cp's OEIS Frontend

A029967 Palindromic in bases 12 and 10.

%I A029967 #31 Mar 23 2020 03:01:42
%S A029967 0,1,2,3,4,5,6,7,8,9,11,181,555,616,676,737,797,1111,8008,35953,43934,
%T A029967 88888,646646,3192913,5641465,8364638,9963699,133373331,139979931,
%U A029967 293373392,520020025,713171317,796212697,1393223931
%N A029967 Palindromic in bases 12 and 10.
%H A029967 Robert G. Wilson v, <a href="/A029967/b029967.txt">Table of n, a(n) for n = 1..57</a>
%H A029967 Patrick De Geest, <a href="http://www.worldofnumbers.com/nobase10.htm">Palindromic numbers beyond base 10</a>
%t A029967 Select[Range[0, 10^5], PalindromeQ[#] && # == IntegerReverse[#, 12] &] (* _Robert Price_, Nov 09 2019 *)
%o A029967 (Python)
%o A029967 from gmpy2 import digits
%o A029967 def palQ(n,b): # check if n is a palindrome in base b
%o A029967     s = digits(n,b)
%o A029967     return s == s[::-1]
%o A029967 def palQgen10(l): # generator of palindromes in base 10 of length <= 2*l
%o A029967     if l > 0:
%o A029967         yield 0
%o A029967         for x in range(1,l+1):
%o A029967             for y in range(10**(x-1),10**x):
%o A029967                 s = str(y)
%o A029967                 yield int(s+s[-2::-1])
%o A029967             for y in range(10**(x-1),10**x):
%o A029967                 s = str(y)
%o A029967                 yield int(s+s[::-1])
%o A029967 A029967_list = [n for n in palQgen10(5) if palQ(n,12)] # _Chai Wah Wu_, Dec 01 2014
%Y A029967 Cf. A007632, A007633, A029961, A029962, A029963, A029964, A029804, A029965, A029966, A029968, A029969, A029970, A029731, A097855, A099165.
%K A029967 nonn,base
%O A029967 1,3
%A A029967 _Patrick De Geest_