|
| |
|
|
A092323
|
|
2^m - 1 appears 2^m times.
|
|
2
| |
|
|
0, 1, 1, 3, 3, 3, 3, 7, 7, 7, 7, 7, 7, 7, 7, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| Or, write n in binary and change the most significant bit to 0 and all other bits to 1.
a(n) = A053644(n) - 1 = A003817(n) - A053644(n).
a(n) = floor(A003817(n-1)/2). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 18 2010]
|
|
|
FORMULA
| a(n) = if n=1 then 0 else a(floor(n/2))*2 + 1.
a(1)=0, a(2n) = 2a(n)+1, a(2n+1) = a(2n). -- Ralf Stephan, Nov 18 2010
|
|
|
CROSSREFS
| Sequence in context: A142716 A195758 A079084 * A092531 A125002 A098528
Adjacent sequences: A092320 A092321 A092322 * A092324 A092325 A092326
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 15 2004
|
| |
|
|
