OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
PROG
(Python)
def ispal(s): return s == s[::-1]
def a(n): return sum(ispal(str(i)) for i in range(n, 2*n+1))
print([a(n) for n in range(1, 100)]) # Michael S. Branicky, Oct 01 2021
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy and Jason Earls, Jul 22 2003
STATUS
approved