Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007559
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007559 Triple factorial numbers (3*n-2)!!! with leading 1 added.
(Formerly M3627)
+0
61
1, 1, 4, 28, 280, 3640, 58240, 1106560, 24344320, 608608000, 17041024000, 528271744000, 17961239296000, 664565853952000, 26582634158080000, 1143053268797440000, 52580450364682240000, 2576442067869429760000 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n) = number of increasing quaternary trees on n vertices. (See A001147 for ternary and A000142 for binary trees.) - David Callan (callan(AT)stat.wisc.edu), Mar 30 2007

LINKS

T. D. Noe, Table of n, a(n) for n=0..100

W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.

FORMULA

E.g.f.: (1-3*x)^(-1/3).

a(n) ~ 2^(1/2)*pi^(1/2)*Gamma(1/3)^-1*n^(-1/6)*3^n*e^-n*n^n*{1 - 1/36*n^-1 - ...}. - Joe Keane (jgk(AT)jgk.org), Nov 22 2001

a(0) := 1, a(n)=(3*n-2)!!! := product(3*k+1, k=0..n-1).

a(n)= 3^n*Pochhammer(1/3, n).

a(n) = Sum_{k=0..n} (-3)^(n-k)*A048994(n, k) .- Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 29 2005

CROSSREFS

Cf. A001147, A004987, A032031, A008544, A051141. a(n)= A035469(n, 1), n >= 1, (first column of triangle A035469(n, m)).

Adjacent sequences: A007556 A007557 A007558 this_sequence A007560 A007561 A007562

Sequence in context: A081917 A128318 A032274 this_sequence A138208 A071212 A090353

KEYWORD

nonn,nice,easy

AUTHOR

njas.

EXTENSIONS

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

page 1

Search completed in 0.003 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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research