A048882 A convolution triangle of numbers obtained from A034255.
1, 10, 1, 120, 20, 1, 1560, 340, 30, 1, 21216, 5520, 660, 40, 1, 297024, 88032, 12880, 1080, 50, 1, 4243200, 1392768, 236448, 24640, 1600, 60, 1, 61526400, 21952320, 4187232, 512464, 41800, 2220, 70, 1, 902387200, 345396480, 72452160, 10060416
Offset: 0
Links
- W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
Formula
a(n+1, m) = 4*(4*n+m)*a(n, m)/(n+1) + m*a(n, m-1)/(n+1), n >= m >= 1; a(n, m) := 0, n
G.f. for column m: ((-1+(1-16*x)^(-1/4))/4)^m.
A007696 Quartic (or 4-fold) factorial numbers: a(n) = Product_{k = 0..n-1} (4*k + 1).
1, 1, 5, 45, 585, 9945, 208845, 5221125, 151412625, 4996616625, 184874815125, 7579867420125, 341094033905625, 16713607661375625, 885821206052908125, 50491808745015763125, 3080000333445961550625, 200200021673987500790625, 13813801495505137554553125
Offset: 0
Comments
a(n), n >= 1, enumerates increasing quintic (5-ary) trees. See David Callan's comment on A007559 (number of increasing quarterny trees).
Hankel transform is A169619. - Paul Barry, Dec 03 2009
Examples
G.f. = 1 + x + 5*x^2 + 45*x^3 + 585*x^4 + 9945*x^5 + 208845*x^6 + ...
References
- N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Links
- T. D. Noe, Table of n, a(n) for n = 0..100
- Wolfdieter Lang, On generalizations of Stirling number triangles, J. Integer Seq. 3 (2000), Article 00.2.4.
- J.-C. Novelli and J.-Y. Thibon, Hopf Algebras of m-permutations, (m+1)-ary trees, and m-parking functions, arXiv:1403.5962 [math.CO], 2014.
- Maxie D. Schmidt, Generalized j-Factorial Functions, Polynomials, and Applications , J. Integer Seq. 13 (2010), Article 10.6.7; see page 39.
- Michael Z. Spivey and Laura L. Steil, The k-Binomial Transforms and the Hankel Transform, J. Integer Seq. 9 (2006), Article 06.1.1.
Crossrefs
Programs
-
GAP
a:=[1,1];; for n in [3..20] do a[n]:=(4*(n-1)-7)*(a[n-1]+4*a[n-2]); od; a; # G. C. Greubel, Aug 15 2019
-
Magma
[n le 2 select 1 else (4*(n-1)-7)*(Self(n-1) + 4*Self(n-2)): n in [1..20]]; // G. C. Greubel, Aug 15 2019
-
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);# Zerinvary Lajos, 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
a[ n_]:= Pochhammer[ 1/4, n] 4^n; (* Michael Somos, Jan 17 2014 *) a[ n_]:= If[n < 0, 1 / Product[ -k, {k, 3, -4n-1, 4}], Product[ k, {k, 1, 4n-3, 4}]]; (* Michael Somos, Jan 17 2014 *) Range[0, 19]! CoefficientList[Series[((1-4x)^(-1/4)), {x, 0, 19}], x] (* Vincenzo Librandi, Oct 08 2015 *)
-
Maxima
A007696(n):=prod(4*k+1,k,0,n-1)$ makelist(A007696(n),n,0,30); /* Martin Ettl, Nov 05 2012 */
-
PARI
{a(n) = if( n<0, 1 / prod(k=1, -n, 1 - 4*k), prod(k=1, n, 4*k - 3))}; /* Michael Somos, Jan 17 2014 */ -
Sage
[4^n*rising_factorial(1/4, n) for n in (0..20)] # G. C. Greubel, Aug 15 2019
Formula
E.g.f.: (1 - 4*x)^(-1/4).
a(n) ~ 2^(1/2) * Pi^(1/2) * Gamma(1/4)^(-1) * n^(-1/4) * 2^(2*n) * e^(-n) * n^n * (1 - 1/96 * n^(-1) - ...). - Joe Keane (jgk(AT)jgk.org), Nov 23 2001 [corrected by Vaclav Kotesovec, Jul 19 2025]
a(n) = Sum_{k = 0..n} (-4)^(n-k) * A048994(n, k). - Philippe Deléham, Oct 29 2005
G.f.: 1/(1 - x/(1 - 4*x/(1 - 5*x/(1 - 8*x/(1 - 9*x/(1 - 12*x/(1 - 13*x/(1 - .../(1 - A042948(n+1)*x/(1 -... (continued fraction). - Paul Barry, Dec 03 2009
a(n) = (-3)^n * Sum_{k = 0..n} (4/3)^k * s(n+1, n+1-k), where s(n,k) are the Stirling numbers of the first kind, A048994. - Mircea Merca, May 03 2012
G.f.: 1/T(0), where T(k) = 1 - x * (4*k + 1)/(1 - x * (4*k + 4)/T(k+1)) (continued fraction). - Sergei N. Gladkovskii, Mar 19 2013
G.f.: 1 + x/Q(0), where Q(k) = 1 + x + 2*(2*k - 1)*x - 4*x*(k+1)/Q(k+1) (continued fraction). - Sergei N. Gladkovskii, May 03 2013
G.f.: G(0)/2, where G(k) = 1 + 1/(1 - x * (4*k + 1)/(x * (4*k + 1) + 1/G(k+1))) (continued fraction). - Sergei N. Gladkovskii, Jun 04 2013
0 = a(n) * (4*a(n+1) - a(n+2)) + a(n+1) * a(n+1) for all n in Z. - Michael Somos, Jan 17 2014
a(-n) = (-1)^n / A008545(n). - Michael Somos, Jan 17 2014
Let T(x) = 1/(1 - 3*x)^(1/3) be the e.g.f. for the sequence of triple factorial numbers A007559. Then the e.g.f. A(x) for the quartic factorial numbers satisfies T(Integral_{t = 0..x} A(t) dt) = A(x). (Cf. A007559 and A008548.) - Peter Bala, Jan 02 2015
O.g.f.: hypergeom([1, 1/4], [], 4*x). - Peter Luschny, Oct 08 2015
a(n) = A264781(4*n+1, n). - Alois P. Heinz, Nov 24 2015
a(n) = 4^n * Gamma(n + 1/4)/Gamma(1/4). - Artur Jasinski, Aug 23 2016
D-finite with recurrence: a(n) +(-4*n+3)*a(n-1)=0, n>=1. - R. J. Mathar, Feb 14 2020
Sum_{n>=0} 1/a(n) = 1 + exp(1/4)*(Gamma(1/4) - Gamma(1/4, 1/4))/(2*sqrt(2)). - Amiram Eldar, Dec 18 2022
Extensions
Better description from Wolfdieter Lang, Dec 11 1999
A004130 Numerators in expansion of (1-x)^{-1/4}.
1, 1, 5, 15, 195, 663, 4641, 16575, 480675, 1762475, 13042315, 48612265, 729183975, 2748462675, 20809788825, 79077197535, 4823709049635, 18443593425075, 141400882925575, 543277076503525, 8366466978154285, 32270658344309385
Offset: 0
Comments
Numerators in expansion of sqrt(1/sqrt(1-4x)). - Paul Barry, Jul 12 2005
Denominators are in A088802. - Michael Somos, Aug 23 2007
Links
- Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Programs
-
Mathematica
Table[Numerator[Binomial[-1/4, n] (-1)^n], {n, 0, 20}] -
PARI
{a(n) = if( n<0, 0, numerator( polcoeff( (1 - x +x*O(x^n))^(-1/4), n ) ) ) } /* Michael Somos, Aug 23 2007 */
Formula
a(n) = prod(k=1, n, (4k-3)/k * 2^A007814(k)), proved by Mitch Harris, following a conjecture by Ralf Stephan.
a(n) = 2^(e_2((2n)!)-n)/n! Product[4k+1,{k,0,n-1}], where e_2((2n)!) is the highest power of 2 that divides (2n)! (sequence A005187). - Emanuele Munarini, Jan 25 2011
Numerators in (1-4t)^(-1/4) = 1 + t + (5/2)t^2 + (15/2)t^3 + (195/8)t^4 + (663/8)t^5 + (4641/16)t^6 + (16575/16)t^7 + ... = 1 + t + 5*t^2/2! + 45*t^3/3! + 585*t^4/4! + ... = e.g.f. for the quartic factorials A007696 (cf. A094638). - Tom Copeland, Dec 04 2013
A034687 Related to quintic factorial numbers A008548.
1, 15, 275, 5500, 115500, 2502500, 55412500, 1246781250, 28398906250, 653174843750, 15141780468750, 353308210937500, 8289154179687500, 195387205664062500, 4624163867382812500, 109823891850341796875
Offset: 1
Links
- Michael De Vlieger, Table of n, a(n) for n = 1..717 (first 500 terms from G. C. Greubel).
- Wolfdieter Lang, On generalizations of the Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), Article 00.2.4.
- Elżbieta Liszewska and Wojciech Młotkowski, Some relatives of the Catalan sequence, arXiv:1907.10725 [math.CO], 2019.
Programs
-
GAP
List([1..20], n-> 5^(n-1)*Product([0..n-1], k-> 5*k+1)/Factorial(n)); # G. C. Greubel, Aug 17 2019
-
Magma
[5^(n-1)*(&*[5*k+1: k in [0..n-1]])/Factorial(n): n in [1..20]]; // G. C. Greubel, Aug 17 2019
-
Maple
seq(5^(n-1)*(product(5*k+1, k = 0..n-1))/factorial(n), n = 1..20); # G. C. Greubel, Aug 17 2019
-
Mathematica
Table[5^(2*n-1)*Pochhammer[1/5, n]/n!, {n, 20}] (* G. C. Greubel, Aug 17 2019 *) -
PARI
vector(20, n, 5^(n-1)*prod(k=0, n-1, 5*k+1)/n!) \\ G. C. Greubel, Aug 17 2019
-
Sage
[5^(n-1)*product(5*k+1 for k in (0..n-1))/factorial(n) for n in (1..20)] # G. C. Greubel, Aug 17 2019
Formula
G.f.: (-1 + (1-25*x)^(-1/5))/5.
E.g.f.: (1/5)*L_{-1/5}(25*x) - 1, where L_{k}(x) is the Laguerre polynomial. - Stefano Spezia, Aug 17 2019
a(n) ~ 5^(2*n-1) * n^(-4/5) / Gamma(1/5). - Amiram Eldar, Aug 17 2025
Comments