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!)
A073588 a(n) = a(n-1)*2^n-1 with a(1)=1. 2

%I #21 Jun 19 2021 10:55:21

%S 1,3,23,367,11743,751551,96198527,24626822911,12608933330431,

%T 12911547730361343,26442849751780030463,108309912583291004776447,

%U 887274803882319911128653823,14537110386807929423931864236031

%N a(n) = a(n-1)*2^n-1 with a(1)=1.

%F a(n) = ceiling(C*2^(n*(n+1)/2)) where C is a constant, C = 0.3583674393448461337061572297745... In fact, C = Sum_{k>=0} 1/2^(k*(k+1)/2) - 1/2^(k*(k+3)/2) = Sum_{k>=0} 1/2^A000217(k) - Sum_{k>=0} 1/2^A000096(k). - _Benoit Cloitre_, Sep 01 2002

%F a(n) = ceiling(C*2^(n*(n+1)/2)) where C is a constant, C = 0.3583674393448461337061572297745... - _Benoit Cloitre_, Sep 01 2002

%t a = 1; Table[a = a*2^n - 1, {n, 14}] (* _Jayanta Basu_, Jul 02 2013 *)

%K easy,nonn

%O 1,2

%A _Felice Russo_, Aug 28 2002

%E Definition corrected by _Georg Fischer_, Jun 19 2021

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 25 13:45 EDT 2024. Contains 371975 sequences. (Running on oeis4.)