OFFSET
1,3
COMMENTS
For each term having fewer than 10 digits, the square will also be a palindrome. - Dmitry Kamenetsky, Oct 21 2008
LINKS
Ray Chandler, Table of n, a(n) for n = 1..10000
MATHEMATICA
(* get NextPalindrome from A029965 *)
Select[ NestList[ NextPalindrome, 0, 11110], Max(AT) IntegerDigits(AT)# < 2 &] (* Robert G. Wilson v *)
Select[FromDigits/@Tuples[{0, 1}, 8], IntegerDigits[#]==Reverse[ IntegerDigits[ #]]&] (* Harvey P. Dale, Apr 20 2015 *)
PROG
(Sage)
[int(n.binary()) for n in (0..220) if Word(n.digits(2)).is_palindrome()] # Peter Luschny, Sep 13 2018
(Python)
from itertools import count, islice, product
def agen(): # generator of terms
yield from [0, 1]
for d in count(2):
for rest in product("01", repeat=d//2-1):
left = "1" + "".join(rest)
for mid in [[""], ["0", "1"]][d%2]:
yield int(left + mid + left[::-1])
print(list(islice(agen(), 32))) # Michael S. Branicky, Mar 29 2022
(Python)
def A057148(n):
if n == 1: return 0
a = 1<<n.bit_length()-2
s = bin(a|(n&a-1))[2:]
return int(s+(s[::-1] if a&n else s[-2::-1])) # Chai Wah Wu, Jun 10 2024
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Henry Bottomley, Aug 14 2000
STATUS
approved