[go: up one dir, main page]

login
A050422
Numbers for which in base 2 the least number of digits that can be removed to leave a palindrome (possibly beginning with 0) is 3.
2
52, 56, 88, 104, 112, 114, 116, 120, 142, 143, 150, 151, 168, 176, 184, 196, 200, 208, 212, 216, 220, 224, 226, 228, 233, 234, 236, 241, 242, 244, 248, 268, 270, 271, 278, 279, 282, 283, 286, 287, 302, 303, 304, 332, 334, 335, 336, 344, 352, 356, 360, 376, 388
OFFSET
1,1
EXAMPLE
(88 base 2) = 1011000 -> 0000.
PROG
(Python)
from itertools import combinations
def ok(n):
b = bin(n)[2:]
for digs_to_remove in range(4):
for skip in combinations(range(len(b)), digs_to_remove):
newb = "".join(b[i] for i in range(len(b)) if i not in skip)
if len(newb) > 0 and newb == newb[::-1]:
return (digs_to_remove == 3)
return False
print(list(filter(ok, range(390)))) # Michael S. Branicky, Aug 24 2021
CROSSREFS
KEYWORD
nonn,base
STATUS
approved