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!)
A092754 a(1)=1, a(2n)=2a(n)+1, a(2n+1)=2a(n)+2. 4

%I #26 Jun 19 2021 12:40:42

%S 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,

%T 41,42,43,44,45,46,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,

%U 80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,127,128,129,130,131,132

%N a(1)=1, a(2n)=2a(n)+1, a(2n+1)=2a(n)+2.

%C 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).

%H Reinhard Zumkeller, <a href="/A092754/b092754.txt">Table of n, a(n) for n = 1..10000</a>

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

%F a(n) = A004754(n) - 1. - _Rémy Sigrist_, May 05 2019

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

%o (PARI) a(n) = n + 1<<logint(n,2) - 1; \\ _Kevin Ryde_, Jun 19 2021

%o (Haskell)

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

%o where (n',m) = divMod n 2

%o a092754_list = map a092754 [1..]

%o -- _Reinhard Zumkeller_, May 07 2012

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

%Y Cf. A206332 (complement).

%Y Cf. A004754.

%K easy,nonn

%O 1,2

%A _Benoit Cloitre_, Apr 13 2004

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)