login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A083664 a(1) = 1, a(n) = if n mod 10 = 0 then n else smallest number m, not occurring earlier such that m*a(n-d) is a palindrome, where d = if n mod 10 = 1 then 2 else 1. 3
1, 2, 3, 11, 4, 22, 28, 9, 19, 10, 17, 16, 29, 8, 34, 88, 7, 23, 18, 20, 14, 31, 154, 13, 38, 231, 12, 21, 25, 30, 209, 42, 6, 37, 15, 35, 143, 49, 77, 40, 26, 33, 47, 303, 57, 333, 64, 66, 32, 50, 132, 48, 44, 53, 404, 58, 364, 111, 5, 60, 101, 55, 91, 99, 46, 437, 92, 236 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Permutation of natural numbers: a(A083665(n))=A083665(a(n))=n;
for n>1: a(n)=n iff n == 0 modulo 10.
LINKS
CROSSREFS
Sequence in context: A201267 A046641 A336876 * A083125 A332661 A031335
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 02 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 10:55 EDT 2024. Contains 371241 sequences. (Running on oeis4.)