login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092525 To binary representation of n, append as many ones as there are trailing zeros. 0
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = (n+1)*A006519(n)-1;

a(2*n-1) = 2*n-1, a(2*n) > 4*n.

EXAMPLE

n=20='10100'='101'00' -> a(20)='101'00'11'='1010011'=83.

CROSSREFS

Cf. A007814, A007088.

Sequence in context: A075453 A073845 A169697 * A101367 A049457 A061037

Adjacent sequences:  A092522 A092523 A092524 * A092526 A092527 A092528

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 07 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 19:01 EST 2012. Contains 205535 sequences.