id:A092525 - OEIS Search Results

Search: id:A092525

Displaying 1-1 of 1 results found.

page 1

To binary representation of n, append as many ones as there are trailing zeros.

+0
1

1, 5, 3, 19, 5, 13, 7, 71, 9, 21, 11, 51, 13, 29, 15, 271, 17, 37, 19, 83, 21, 45, 23, 199, 25, 53, 27, 115, 29, 61, 31, 1055, 33, 69, 35, 147, 37, 77, 39, 327, 41, 85, 43, 179, 45, 93, 47, 783, 49, 101, 51, 211, 53, 109, 55, 455, 57, 117, 59, 243, 61, 125, 63, 4159 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = (n+1)A006519(n)-1;` `a(2n-1) = 2n-1, a(2n) > 4*n.`
	EXAMPLE	`n=20='10100'='101'00' -> a(20)='101'00'11'='1010011'=83.`
	CROSSREFS	`Cf. A007814, A007088.` `Sequence in context: A133172 A075453 A073845 this_sequence A101367 A049457 A061037` `Adjacent sequences: A092522 A092523 A092524 this_sequence A092526 A092527 A092528`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 07 2004`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research