login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085764 Least integer m such that between m and 2m there are n palindromes. 1
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; internal format)
OFFSET

1,1

COMMENTS

Dean Hickerson showed that this sequence is infinite.

CROSSREFS

Cf. A085763.

Sequence in context: A174921 A010180 A109013 * A090555 A010179 A174209

Adjacent sequences:  A085761 A085762 A085763 * A085765 A085766 A085767

KEYWORD

nonn,base

AUTHOR

Jason Earls, Amarnath Murthy (zevi_35711(AT)yahoo.com), Jul 22 2003

EXTENSIONS

More terms from Jason Earls (zevi_35711(AT)yahoo.com), Jul 24 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:39 EST 2012. Contains 205823 sequences.