login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092754 a(1)=1, a(2n)=2a(n)+1, a(2n+1)=2a(n)+2. 3
1, 3, 4, 7, 8, 9, 10, 15, 16, 17, 18, 19, 20, 21, 22, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 127, 128, 129, 130, 131, 132 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

More generally the sequence b(1)=1, b(2n)=2b(n)+x, b(2n+1)=2b(n)+y is given by the formula b(n)=A053644(n)+x*(n-A053644(n))+y*(A053644(n)-1).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = 2^floor(log(n)/log(2)) + n - 1.

a(n) = A004754(n) - 1. - Rémy Sigrist, May 05 2019

PROG

(PARI) a(n)=if(n<2, 1, if(n%2, a(n-1)+1, a(n/2)*2+1))

(Haskell)

a092754 n = if n < 2 then n else 2 * a092754 n' + m + 1

            where (n', m) = divMod n 2

a092754_list = map a092754 [1..]

-- Reinhard Zumkeller, May 07 2012

CROSSREFS

Cf. A053644 (x=y=0), A054429(x=-1, y=+1), A062050(x=+1, y=-1).

Cf. A206332 (complement).

Cf. A004754.

Sequence in context: A284489 A026343 A080722 * A061094 A100991 A075821

Adjacent sequences:  A092751 A092752 A092753 * A092755 A092756 A092757

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Apr 13 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 8 22:01 EDT 2020. Contains 335537 sequences. (Running on oeis4.)