id:A099257 - OEIS Search Results

Search: id:A099257

Displaying 1-1 of 1 results found.

page 1

a(1)=1, a(n+1) = if a(n)=n then 2*n+1 else smallest number not occurring earlier.

+0
4

1, 3, 2, 4, 9, 5, 6, 7, 8, 10, 21, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 45, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 93, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Permutation of the natural numbers with inverse A099258;` `a(A033484(n)) = A033484(n);` `a(A033484(n) + 1) = 2*A033484(n) + 1 = A068156(n).`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	FORMULA	`a(n) = if n = 32^k - 2 then n else (if n = 32^k - 1 then 2*n + 1 else n - 1).`
	CROSSREFS	`Adjacent sequences: A099254 A099255 A099256 this_sequence A099258 A099259 A099260` `Sequence in context: A075087 A084657 A019916 this_sequence A083762 A083164 A094962`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 09 2004`

page 1

Search completed in 0.002 seconds

Last modified November 8 07:45 EST 2009. Contains 166143 sequences.

AT&T Labs Research