OFFSET
1,2
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..101 (all terms < 10^14)
MATHEMATICA
subtract = If[ #1 < #2, Throw[ #1], #1 - #2]&; d[n_] := Catch @ Fold[subtract, n, Divisors @ n]; Select[Range[10000000], PalindromeQ[#]&&PalindromeQ[d[#]]&] (* James C. McMahon, Mar 31 2024 *)
PROG
(Python) # uses imports, function in A109883
from itertools import count, islice, product
def ispal(n): return (s:=str(n)) == s[::-1]
def pals(): # generator of palindromes
digits = "0123456789"
yield from map(int, digits)
for d in count(2):
for f in "123456789":
for p in product(digits, repeat=d//2-1):
left = f + "".join(p); right = left[::-1]
for mid in [[""], digits][d%2]:
yield int(left + mid + right)
def agen(): yield from (p for p in pals() if p>0 and ispal(A109883(p)))
print(list(islice(agen(), 40))) # Michael S. Branicky, Mar 31 2024
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Jason Earls, Sep 02 2005
EXTENSIONS
a(38) and beyond from Michael S. Branicky, Mar 31 2024
STATUS
approved