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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069506 a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1. 5
2, 5, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111111111111 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

FORMULA

a(n) = {10^(n-1)-1}/9 for n > 2.

CROSSREFS

Cf. A069505, A069507, A069508, A069509, A069510.

Sequence in context: A134998 A078790 A158999 * A123165 A098438 A064772

Adjacent sequences:  A069503 A069504 A069505 * A069507 A069508 A069509

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 30 2002.

EXTENSIONS

More terms from Patrick De Geest (pdg(AT)worldofnumbers.com), Jun 11 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 12:25 EST 2012. Contains 205786 sequences.