login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A073588
a(n) = a(n-1)*2^n-1 with a(1)=1.
2
1, 3, 23, 367, 11743, 751551, 96198527, 24626822911, 12608933330431, 12911547730361343, 26442849751780030463, 108309912583291004776447, 887274803882319911128653823, 14537110386807929423931864236031
OFFSET
1,2
FORMULA
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
a(n) = ceiling(C*2^(n*(n+1)/2)) where C is a constant, C = 0.3583674393448461337061572297745... - Benoit Cloitre, Sep 01 2002
MATHEMATICA
a = 1; Table[a = a*2^n - 1, {n, 14}] (* Jayanta Basu, Jul 02 2013 *)
CROSSREFS
Sequence in context: A092664 A363577 A260509 * A068338 A255881 A243195
KEYWORD
easy,nonn
AUTHOR
Felice Russo, Aug 28 2002
EXTENSIONS
Definition corrected by Georg Fischer, Jun 19 2021
STATUS
approved