login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092323 2^m - 1 appears 2^m times. 3
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; text; 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). [Reinhard Zumkeller, Jul 18 2010]
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 14:54 EDT 2024. Contains 371960 sequences. (Running on oeis4.)