Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051606
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051606 (3*n+6)!!!/6!!!, related to A032031 ((3*n)!!! triple factorials). +0
3
1, 9, 108, 1620, 29160, 612360, 14696640, 396809280, 11904278400, 392841187200, 14142282739200, 551549026828800, 23165059126809600, 1042427660706432000, 50036527713908736000, 2551862913409345536000, 137800597324104658944000 (list; graph; listen)
OFFSET

0,2

COMMENT

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

FORMULA

a(n) = ((3*n+6)(!^3))/6(!^3); e.g.f.: 1/(1-3*x)^3.

a(n)=n!*3^(n-2)/2, n>=2 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 23 2006

MAPLE

[seq(n!*3^(n-2)/2, n=2..18)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 23 2006

with(combstruct):ZL:=[T, {T=Union(Z, Prod(Epsilon, Z, T), Prod(T, Z, Epsilon), Prod(T, Z))}, labeled]:seq(count(ZL, size=i)/6, i=2..18); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 16 2007

restart: G(x):=(1-3*x)^(n-4): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1], x) od:x:=0:seq(f[n], n=0..16); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 04 2009]

CROSSREFS

Cf. A032031, A007559(n+1), A034000(n+1), A034001(n+1), A051604-A051609 (rows m=0..9).

Sequence in context: A080505 A104224 A099676 this_sequence A001691 A157906 A166846

Adjacent sequences: A051603 A051604 A051605 this_sequence A051607 A051608 A051609

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research