Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082204
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
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: A107259 A121041 A003589 this_sequence A087159 A062502 A141242

Adjacent sequences: A082201 A082202 A082203 this_sequence 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

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research