Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069506
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069506 a(1) = 2; a(n) = smallest palindromic number of the form k*a(n-1) + 1 with k > 1. +0
6
2, 5, 11, 111, 1111, 11111, 111111, 1111111, 11111111, 111111111, 1111111111, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111111111111 (list; graph; listen)
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 this_sequence A123165 A098438 A064772

Adjacent sequences: A069503 A069504 A069505 this_sequence 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.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research