id:A084483 - OEIS Search Results

Search: id:A084483

Displaying 1-1 of 1 results found.

page 1

If the rightmost block of zeros in binary representation of n has an even length, then delete one 0, otherwise insert one 0 in this block.

+0
2

1, 4, 3, 2, 9, 12, 7, 16, 5, 20, 19, 6, 25, 28, 15, 8, 33, 36, 11, 10, 41, 44, 39, 48, 13, 52, 51, 14, 57, 60, 31, 64, 17, 68, 67, 18, 73, 76, 23, 80, 21, 84, 83, 22, 89, 92, 79, 24, 97, 100, 27, 26, 105, 108, 103, 112, 29, 116, 115, 30, 121, 124, 63, 32, 129 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(a(n))=n, self-inverse permutation of natural numbers;` `a(n) = n iff n = 2^k - 1, k>0;` `-1<=A023416(a(n))-A023416(n)<=1; A000120(a(n))=A000120(n); -1<=A070939(a(n))-A070939(n)<=1.`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	FORMULA	`a(2n+1) = 2a(n)+1, a(4n+2) = 8n+4, a(4n) = 2n(4-3*A035263(n)). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 09 2003`
	EXAMPLE	`n=43 in binary 101011: insert a 0 in the rightmost block of zeros` `consisting of one (odd!) 0: 1010011 -> 83=a(43);` `n=41 in binary 101001: delete a 0 from the rightmost block of` `zeros consisting of two (even!) 0's: 10101 -> 21=a(41).`
	CROSSREFS	`Cf. A084484(n)=A007088(a(n)).` `Adjacent sequences: A084480 A084481 A084482 this_sequence A084484 A084485 A084486` `Sequence in context: A018866 A021235 A020703 this_sequence A058509 A105109 A065367`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 27 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 00:02 EST 2008. Contains 150810 sequences.

AT&T Labs Research