id:A083664 - OEIS Search Results

Search: id:A083664

Displaying 1-1 of 1 results found.

page 1

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.

+0
4

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; listen)

	OFFSET	`1,2`
	COMMENT	`Permutation of natural numbers: a(A083665(n))=A083665(a(n))=n;` `for n>1: a(n)=n iff n == 0 modulo 10.`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Cf. A083666, A083125, A002113.` `Sequence in context: A098929 A073098 A046641 this_sequence A083125 A031335 A084743` `Adjacent sequences: A083661 A083662 A083663 this_sequence A083665 A083666 A083667`
	KEYWORD	`nonn,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 02 2003`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research