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!)
A135540 a(n) = 2^(A000523(n) - A000120(n) + 2) - 1. 2
1, 3, 1, 7, 3, 3, 1, 15, 7, 7, 3, 7, 3, 3, 1, 31, 15, 15, 7, 15, 7, 7, 3, 15, 7, 7, 3, 7, 3, 3, 1, 63, 31, 31, 15, 31, 15, 15, 7, 31, 15, 15, 7, 15, 7, 7, 3, 31, 15, 15, 7, 15, 7, 7, 3, 15, 7, 7, 3, 7, 3, 3, 1, 127, 63, 63, 31, 63, 31, 31, 15, 63, 31, 31, 15, 31, 15, 15, 7, 63, 31, 31, 15, 31, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 2^(floor(log_2(n)) - (n - Sum_{k=1,..,n}[floor(n/2^k)]) + 2) - 1. - G. C. Greubel, Oct 18 2016
MAPLE
GS(6, 3, 200); [see A135416].
MATHEMATICA
Table[2^(Floor[Log[2, n]] - (n - Sum[Floor[n/2^k], {k, 1, n}]) + 2) - 1, {n, 1, 25}] (* G. C. Greubel, Oct 18 2016 *)
CROSSREFS
Cf. A135416.
This is Guy Steele's sequence GS(6, 3) (see A135416).
Sequence in context: A130330 A050227 A354095 * A161942 A370689 A247675
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, based on a message from Guy Steele and Don Knuth, Mar 01 2008
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 23 10:13 EDT 2024. Contains 371905 sequences. (Running on oeis4.)