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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082204 Begin with a 1, then place the smallest (as far as possible distinct) digits, such that, beginning from the n-th term, n terms form a palindrome. 2
1, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2, 3, 2, 2 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

FORMULA

a(1) = 1; for k > 0, a(3k-1) = a(3k) = 2; a(3k+1) = 3. - David Wasserman (wasserma(AT)spawar.navy.mil), Aug 19 2004

EXAMPLE

The first six palindromes are 1, 22, 232, 3223, 22322, 232232.

CROSSREFS

Cf. A082205, A082206.

Sequence in context: A121041 A157439 A003589 * A152727 A087159 A062502

Adjacent sequences:  A082201 A082202 A082203 * A082205 A082206 A082207

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 10 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 19 2004

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 14 18:33 EST 2012. Contains 205663 sequences.