login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,2
FORMULA
a(1) = 1; for k > 0, a(3k-1) = a(3k) = 2; a(3k+1) = 3. - David Wasserman, Aug 19 2004
EXAMPLE
The first six palindromes are 1, 22, 232, 3223, 22322, 232232.
MATHEMATICA
Join[{1}, LinearRecurrence[{0, 0, 1}, {2, 2, 3}, 104]] (* Ray Chandler, Aug 25 2015 *)
CROSSREFS
Sequence in context: A261865 A003589 A361486 * A378914 A152727 A087159
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Apr 10 2003
EXTENSIONS
More terms from David Wasserman, Aug 19 2004
STATUS
approved