Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051583
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051583 (2*n+9)!!/9!!, related to A001147 (odd double factorials). +0
1
1, 11, 143, 2145, 36465, 692835, 14549535, 334639305, 8365982625, 225881530875, 6550564395375, 203067496256625, 6701227376468625, 234542958176401875, 8678089452526869375, 338445488648547905625, 13876265034590464130625 (list; graph; listen)
OFFSET

0,2

COMMENT

Row m=9 of the array A(3; m,n) := (2*n+m)!!/m!!, m >= 0, n >= 0.

FORMULA

a(n) = (2*n+9)!!/9!!; e.g.f.: 1/(1-2*x)^(11/2).

MAPLE

with(finance):seq(mul(cashflows([k, k, 1], 0), k=5..n), n=4..22); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 22 2008]

CROSSREFS

Cf. A000165, A001147(n+1), A002866(n+1), A051577-A051582 (rows m=0..8).

Sequence in context: A024140 A029529 A015687 this_sequence A027771 A098310 A061613

Adjacent sequences: A051580 A051581 A051582 this_sequence A051584 A051585 A051586

KEYWORD

easy,nonn

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research