|
|
A085764
|
|
Least integer m such that between m and 2m there are n palindromes.
|
|
2
|
|
|
10, 1, 2, 3, 4, 51, 61, 66, 76, 86, 96, 111, 121, 131, 141, 157, 167, 177, 187, 197, 202, 212, 222, 232, 242, 258, 268, 278, 288, 298, 303, 313, 323, 333, 343, 359, 369, 379, 389, 399, 404, 414, 424, 434, 444, 460, 470, 480, 490, 500, 501, 5101, 5201, 5301
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
PROG
|
(Python)
def ispal(n): s = str(n); return s == s[::-1]
def a(n):
m, cm = 1, 2
while cm != n:
cm = cm - ispal(m) + ispal(2*m+1) + ispal(2*m+2)
m += 1
return m
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|