|
Search: id:A138523
|
|
|
| A138523 |
|
a(n) = sum{k=1 to n} (2k-1)!. |
|
+0
3
|
|
| 1, 7, 127, 5167, 368047, 40284847, 6267305647, 1313941673647, 357001369769647, 122002101778601647, 51212944273488041647, 25903229683158464681647, 15537113273014144448681647, 10904406563691366305216681647
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MAPLE
|
a:=proc(n) options operator, arrow: sum(factorial(2*k-1), k=1..n) end proc: seq(a(n), n=1..14); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 31 2008
|
|
MATHEMATICA
|
Table[Sum[(2i - 1)!, {i, 1, n}], {n, 1, 15}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Mar 25 2008
|
|
CROSSREFS
|
Cf. A138524, A138525.
Cf. A007489.
Sequence in context: A139291 A092676 A002067 this_sequence A034670 A020516 A077585
Adjacent sequences: A138520 A138521 A138522 this_sequence A138524 A138525 A138526
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Mar 23 2008
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Emeric Deutsch (deutsch(AT)duke.poly.edu) and Robert G. Wilson v, Mar 25 2008
|
|
|
Search completed in 0.002 seconds
|
