login
A085763
Number of palindromes between n and 2n (inclusive).
2
2, 3, 4, 5, 5, 5, 4, 3, 2, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11
OFFSET
1,1
LINKS
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
Sequence in context: A113771 A131845 A062186 * A273264 A281826 A062985
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy and Jason Earls, Jul 22 2003
STATUS
approved