A135540 a(n) = 2^(A000523(n) - A000120(n) + 2) - 1.

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

Offset: 1

Author

N. J. A. Sloane, based on a message from Guy Steele and Don Knuth, Mar 01 2008

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 1..1000

Crossrefs

Cf. A135416.

This is Guy Steele's sequence GS(6, 3) (see A135416).

Programs

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 *)

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