login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107716 Inverse INVERT transform of triple factorial numbers (3*n-2)!!! (A007559). 5
1, 3, 21, 219, 2973, 49323, 964173, 21680571, 551173053, 15633866379, 489583062381, 16780438408539, 624935780160285, 25131869565110571, 1085528359404039117, 50124679063548821499, 2464153823558024331645 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Column 0 of triangle A107717.

FORMULA

G.f.: A(x) = 1 - 1/[1 + Sum_{n>=1} (3*n-2)!!! * x^n ] where (3*n-2)!!! = Product_{k=0..n-1} (3*k+1).

a(n) = Sum_{k, 0<=k<=n} A089949(n, k)*3^k . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 15 2005

EXAMPLE

The triple factorials begin: {1,4,28,280,3640,58240,...}; thus the inverse INVERT transform of the triple factorials can be calculated by the g.f.s:

1/(1 + x + 4*x^2 + 28*x^3 + 280*x^4 + 3640*x^5 + 58240*x^6 +...) = (1 - x - 3*x^2 - 21*x^3 - 219*x^4 - 2973*x^5 - 49323*x^6 -...).

PROG

(PARI) a(n)=polcoeff(1-(1+sum(k=1, n+1, prod(j=0, k-1, 3*j+1)*x^k)+x^2*O(x^n))^-1, n+1)

CROSSREFS

Cf. A007559, A000698, A107717.

Sequence in context: A120972 A168479 A158838 * A032033 A099121 A107864

Adjacent sequences:  A107713 A107714 A107715 * A107717 A107718 A107719

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 23 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:13 EST 2012. Contains 206050 sequences.