login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A092323
2^m - 1 appears 2^m times.
4
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
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). [Reinhard Zumkeller, Jul 18 2010]
FORMULA
a(n) = if n=1 then 0 else a(floor(n/2))*2 + 1.
a(1)=0, a(2n) = 2*a(n)+1, a(2n+1) = a(2n). - Ralf Stephan, Nov 18 2010
MATHEMATICA
Table[FromDigits[#, 2] &@ Table[1, {IntegerLength[n, 2] - 1}], {n, 80}] (* Michael De Vlieger, Jun 26 2016 *)
Table[Table[2^m-1, 2^m], {m, 0, 6}]//Flatten (* Harvey P. Dale, May 22 2021 *)
PROG
(Magma) [n le 2 select n-1 else Self(Floor(n/2))*2+1: n in [1..100]]; // Vincenzo Librandi, Jun 27 2016
CROSSREFS
Sequence in context: A195758 A304684 A079084 * A339053 A244584 A369233
KEYWORD
nonn,easy
AUTHOR
Reinhard Zumkeller, Feb 15 2004
STATUS
approved