id:A064791 - OEIS Search Results

Search: id:A064791

Displaying 1-1 of 1 results found.

page 1

"Inverse permutation" to A064537. Limits of the recursion b(i+1)=B_[i](b(i)), where b(0)=n and B_[k](j) = B_[k-1](j) + k, k+1 <= j <= 2k; B_[k](j) = B_[k-1](j) - k, 2k+1 <= j <= 3k; B_[k](j) = B_[k-1](j) otherwise. Set a(n)=0 if b tends to infinity.

+0
4

1, 11, 2, 5, 3, 6, 4, 21, 36, 15, 10, 7, 146, 8, 105, 9, 16, 46, 80, 30, 12, 20, 13, 480, 14, 40, 25, 26, 4340, 17, 215, 18, 31, 19, 90, 55, 261, 35, 22, 61, 23, 65, 24, 41, 115, 71, 330, 27, 45, 28, 365, 29, 136, 50, 51, 86, 32, 3136, 33, 56, 34, 96, 161, 3490, 60, 37, 171, 38, 296 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The sequence would be the inverse permutation to A064537 if zero never appears.`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	CROSSREFS	`Sequence in context: A018800 A089566 A010191 this_sequence A074126 A107831 A064928` `Adjacent sequences: A064788 A064789 A064790 this_sequence A064792 A064793 A064794`
	KEYWORD	`easy,nonn`
	AUTHOR	`Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 20 2001`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research