cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A004981 a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 1).

Original entry on oeis.org

1, 2, 10, 60, 390, 2652, 18564, 132600, 961350, 7049900, 52169260, 388898120, 2916735900, 21987701400, 166478310600, 1265235160560, 9647418099270, 73774373700300, 565603531702300, 4346216612028200, 33465867912617140, 258165266754475080, 1994913424920943800
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org)

Keywords

Comments

The convolution of this sequence with itself yields A059304. - T. D. Noe, Jun 11 2002
Conjecture: a(p*n) = a(n) (mod p^2) for prime p = 1 (mod 4) and all positive integers n. Cf. A004982 and A298799. - Peter Bala, Dec 22 2019

Crossrefs

Programs

  • GAP
    List([0..25], n-> 2^n*Product([0..n-1], k-> 4*k+1)/Factorial(n) ); # G. C. Greubel, Aug 22 2019
  • Magma
    [1] cat [2^n*&*[4*k+1: k in [0..n-1]]/Factorial(n): n in [1..25]]; // G. C. Greubel, Aug 22 2019
    
  • Maple
    A004981 := n -> (-8)^n*binomial(-1/4, n):
    seq(A004981(n), n=0..25); # Peter Luschny, Oct 23 2018
  • Mathematica
    CoefficientList[Series[(1-8x)^(-1/4), {x, 0, 25}], x] (* Vincenzo Librandi, Mar 16 2014 *)
    Table[8^n*Pochhammer[1/4, n]/n!, {n,0,25}] (* G. C. Greubel, Aug 22 2019 *)
  • Maxima
    a(n):=if n=0 then 1 else (sum(m*sum(binomial(-m+2*k-1,k-1) *2^(n+m-k)*binomial(2*n-k-1,n-1),k,m,n),m,1,n))/(n); /* Vladimir Kruchinin, Dec 26 2011 */
    
  • PARI
    a(n)=if(n<0,0,prod(k=1,n,(8*k-6)/k))
    
  • PARI
    {a(n)=if(n<0, 0, polcoeff( (1-8*x+x*O(x^n))^(-1/4), n))} /* Michael Somos, Jan 31 2007 */
    
  • Sage
    [8^n*rising_factorial(1/4, n)/factorial(n) for n in (0..25)] # G. C. Greubel, Aug 22 2019
    

Formula

a(n) ~ Gamma(1/4)^-1*n^(-3/4)*2^(3*n)*{1 - 3/32*n^-1 - ...}
G.f.: (1-8*x)^(-1/4).
A002897(n) = Sum_{k=0..n} a(k)^2*a(n-k)^2. - Michael Somos, Jan 31 2007
a(n) = (Sum_{m=1..n} m*Sum_{k=m..n} binomial(-m+2*k-1,k-1)*2^(n+m-k)*binomial(2*n-k-1,n-1))/n, n>0, a(0)=1. - Vladimir Kruchinin, Dec 26 2011
D-finite with recurrence: n*a(n) = 2*(4*n-3)*a(n-1). - R. J. Mathar, Mar 14 2014
From Karol A. Penson, Dec 19 2015: (Start)
a(n) = (-8)^n*binomial(-1/4,n).
E.g.f.: is the hypergeometric function of type 1F1, in Maple notation hypergeom([1/4], [1], 8*x).
Representation as n-th moment of a positive function on (0, 8): a(n)=int(x^n*(sqrt(2)/(16*Pi*(x/8)^(3/4)*(1-x/8)^(1/4))), x=0..8), n=0, 1, ... . This function is the solution of the Hausdorff moment problem on (0, 8) with moments equal to a(n). As a consequence this representation is unique. (End)

Extensions

More terms from James Sellers, May 01 2000

A034171 Related to triple factorial numbers A007559(n+1).

Original entry on oeis.org

1, 6, 42, 315, 2457, 19656, 160056, 1320462, 11003850, 92432340, 781473420, 6642524070, 56716936290, 486145168200, 4180848446520, 36059817851235, 311811366125385, 2702365173086670, 23467908082068450, 204170800313995515, 1779202688450532345, 15527587099204645920
Offset: 0

Views

Author

Keywords

Comments

Working with an offset of 1, we conjecture a(p*n) = a(n) (mod p^2) for prime p = 1 (mod 3) and all positive integers n except those n of the form n = m*p + k for 0 <= m <= (p-1)/3 and 1 <= k <= (p-1)/3. Cf. A298799, A004981 and A004982. - Peter Bala, Dec 23 2019

Crossrefs

Programs

  • Mathematica
    CoefficientList[Series[(-1 + (1 - 9 x)^(-1/3))/(3 x), {x, 0, 19}], x] (* Michael De Vlieger, Oct 13 2019 *)

Formula

a(n) = 3^n*A007559(n+1)/(n+1)! where A007559(n+1)=(3*n+1)!!!.
G.f.: (-1+(1-9*x)^(-1/3))/(3*x).
a(n) = A035529(n+1, 1) (first column of triangle).
Convolution of A004987(n) with A025748(n+1), n >= 0.
From R. J. Mathar, Jan 28 2020: (Start)
D-finite with recurrence: (n+1)*a(n) + 3*(-3*n-1)*a(n-1) = 0.
G.f.: (1F0(1/3;;9*x)-1)/(3*x). (End)
Sum_{n>=0} 1/a(n) = 3/8 + 3*sqrt(3)*Pi/32 + 9*log(3)/32. - Amiram Eldar, Dec 22 2022
a(n) ~ 3^(2*n+1) * n^(-2/3) / Gamma(1/3). - Amiram Eldar, Aug 19 2025

A224881 Expansion of 1/(1 - 16*x)^(1/8).

Original entry on oeis.org

1, 2, 18, 204, 2550, 33660, 460020, 6440280, 91773990, 1325624300, 19354114780, 285033326760, 4227994346940, 63094684869720, 946420273045800, 14259398780556720, 215673406555920390, 3273161111260438860, 49824785804742235980, 760483572809223601800
Offset: 0

Views

Author

Paul D. Hanna, Jul 23 2013

Keywords

Examples

			G.f.: A(x) = 1 + 2*x + 18*x^2 + 204*x^3 + 2550*x^4 + 33660*x^5 + ...
where
A(x)^8 = 1 + 16*x + 256*x^2 + 4096*x^3 + 65536*x^4 + ... + 16^n*x^n + ...
Also,
A(x)^4 = 1 + 8*x + 96*x^2 + 1280*x^3 + 17920*x^4 + 258048*x^5 + ... + 4^n*A000984(n)*x^n + ...
A(x)^2 = 1 + 4*x + 40*x^2 + 480*x^3 + 6240*x^4 + 84864*x^5 + ... + 2^n*A004981(n)*x^n + ...
		

Crossrefs

(1-b*x)^(-1/A003557(b)): A000984 (b=4), A004981 (b=8), A004987 (b=9), A098658 (b=12), this sequence (b=16), A034688 (b=25), A298799 (b=27), A004993 (b=36), A034835 (b=49).
Cf. A301271.

Programs

  • GAP
    List([0..20],n->(2^n/Factorial(n))*Product([0..n-1],k->8*k+1)); # Muniru A Asiru, Jun 23 2018
  • Maple
    seq(coeff(series(1/(1-16*x)^(1/8), x,50),x,n+1),n=0..20); # Muniru A Asiru, Jun 23 2018
  • Mathematica
    CoefficientList[Series[1/(1-16*x)^(1/8), {x, 0, 20}], x] (* Vaclav Kotesovec, Jul 24 2013 *)
  • PARI
    {a(n)=polcoeff(1/(1-16*x +x*O(x^n))^(1/8),n)}
    for(n=0,30,print1(a(n),", "))
    
  • PARI
    {a(n)=(2^n/n!)*prod(k=0,n-1,8*k + 1)}
    for(n=0,30,print1(a(n),", "))
    

Formula

a(n) = (2^n/n!) * Product_{k=0..n-1} (8*k + 1).
a(n) ~ 16^n/(GAMMA(1/8)*n^(7/8)). - Vaclav Kotesovec, Jul 24 2013
Showing 1-3 of 3 results.