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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007696 Quartic (or 4-fold) factorial numbers: a(n) = product(k=0..n-1, 4*k+1 ).
(Formerly M4001)
47
1, 1, 5, 45, 585, 9945, 208845, 5221125, 151412625, 4996616625, 184874815125, 7579867420125, 341094033905625, 16713607661375625, 885821206052908125, 50491808745015763125, 3080000333445961550625, 200200021673987500790625 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

a(n), n>=1, enumerates increasing quintic (5-ary) trees. See a D. Callan comment on A007559 (number of increasing quarterny trees).

Hankel transform is A169619. [From Paul Barry (pbarry(AT)wit.ie), Dec 03 2009]

a(n) is the product of the positive integers k<=4*n that have k == 1 (modulo 4). - Peter Luschny, Jun 23 2011

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, Journal of Integer Sequences, Vol. 9 (2006), Article 06.1.1.

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-4*x)^(-1/4).

a(n) ~ 2^(5/2)*pi^(1/2)*Gamma(1/4)^-1*n^(3/4)*2^(2*n)*e^-n*n^n*{1 + 23/96*n^-1 - ...}. - Joe Keane (jgk(AT)jgk.org), Nov 23 2001

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

G.f.: 1/(1-x/(1-4x/(1-5x/(1-8x/(1-9x/(1-12x/(1-13x/(1-.../(1-A042948(n+1)*x/(1-... (continued fraction). [From Paul Barry (pbarry(AT)wit.ie), Dec 03 2009]

MAPLE

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

A007696 := n -> mul(k, k = select(k-> k mod 4 = 1, [$ 1 .. 4*n])): seq(A007696(n), n=0..17);

- Peter Luschny, Jun 23 2011

MATHEMATICA

s=1; lst={s}; Do[s+=n*s; AppendTo[lst, s], {n, 0, 5!, 4}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 08 2008]

PROG

(PARI) a(n) = prod(k=0, n-1, 4*k+1 );

CROSSREFS

Cf. A001147, A007559, A034255, A004981, A047053, A001813, A051142. a(n)= A049029(n, 1), n >= 1 (first column of triangle).

Sequence in context: A121414 A097328 A051539 * A090136 A090356 A201365

Adjacent sequences:  A007693 A007694 A007695 * A007697 A007698 A007699

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

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

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 13 06:15 EST 2012. Contains 205438 sequences.