|
Search: id:A073588
|
|
|
| A073588 |
|
a(n)=a(n-1)*2^n-1 with a(0)=1. |
|
+0
1
|
|
| 1, 3, 23, 367, 11743, 751551, 96198527, 24626822911, 12608933330431, 12911547730361343, 26442849751780030463, 108309912583291004776447, 887274803882319911128653823, 14537110386807929423931864236031
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n) = ceil(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 (benoit7848c(AT)orange.fr), Sep 01 2002
a(n) = ceil(C*2^(n*(n+1)/2)) where C is a constant, C=0.3583674393448461337061572297745... - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 01 2002
|
|
PROGRAM
|
25 A=1 30 for I=1 to 20 40 A=A*2^I-11 50 print A 60 next 70 end
|
|
CROSSREFS
|
Sequence in context: A118184 A027486 A092664 this_sequence A068338 A114601 A118195
Adjacent sequences: A073585 A073586 A073587 this_sequence A073589 A073590 A073591
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Aug 28 2002
|
|
|
Search completed in 0.002 seconds
|
