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-7 of 7 results.

A004987 a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k + 1). 3-central binomial coefficients.

Original entry on oeis.org

1, 3, 18, 126, 945, 7371, 58968, 480168, 3961386, 33011550, 277297020, 2344420260, 19927572210, 170150808870, 1458435504600, 12542545339560, 108179453553705, 935434098376155, 8107095519260010, 70403724246205350, 612512400941986545, 5337608065351597035, 46582761297613937760
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org)

Keywords

Comments

Diagonal of rational function R(x,y) = (1 - 9*x*y) / (1 - 2*x - 3*y + 3*y^2 + 9*x^2*y). - Gheorghe Coserea, Jul 01 2016
This is the k = 3 variant of the k-central binomial coefficients c(n,k) with g.f. (1 - k^2*x)^(-1/k), which yield the usual central binomial coefficients A001405 for k = 2. - M. F. Hasler, Nov 12 2024

Examples

			G.f.: 1 + 3*x + 18*x^2 + 126*x^3 + 945*x^4 + 7371*x^5 + 58968*x^6 + 480168*x^7 + ...
		

Crossrefs

Related to diagonal of rational functions: A268545-A268555.

Programs

  • GAP
    List([0..25], n-> 3^n*Product([0..n-1], k-> 3*k+1)/Factorial(n) ); # G. C. Greubel, Aug 22 2019
  • Magma
    [1] cat [3^n*&*[3*k+1: k in [0..n-1]]/Factorial(n): n in [1..25]]; // G. C. Greubel, Aug 22 2019
    
  • Maple
    a:= n-> (3^n/n!)*mul(3*k+1, k=0..n-1); seq(a(n), n=0..25); # G. C. Greubel, Aug 22 2019
  • Mathematica
    Table[(-9)^n Binomial[-1/3, n], {n, 0, 25}] (* Jean-François Alcover, Sep 28 2016, after Peter Luschny *)
  • PARI
    a(n) = prod(k=0, n-1, 3*k + 1)*3^n/n! \\ Michel Marcus, Jun 30 2013
    
  • PARI
    my(x='x, y='y);
    R = (1 - 9*x*y) / (1 - 2*x - 3*y + 3*y^2 + 9*x^2*y);
    diag(n, expr, var) = {
      my(a = vector(n));
      for (i = 1, #var, expr = taylor(expr, var[#var - i + 1], n));
      for (k = 1, n, a[k] = expr;
           for (i = 1, #var, a[k] = polcoeff(a[k], k-1)));
      return(a);
    };
    diag(20, R, [x,y])  \\ Gheorghe Coserea, Jul 01 2016
    
  • PARI
    Vec((1-9*x+O(x^25))^(-1/3)) \\ yields the same as:
    apply( {A004987(n)=prod(k=0, n-1, 9*k+3)\n!}, [0..24]) \\ M. F. Hasler, Nov 12 2024
    
  • Sage
    [9^n*rising_factorial(1/3, n)/factorial(n) for n in (0..25)] # G. C. Greubel, Aug 22 2019
    

Formula

G.f.: (1 - 9*x)^(-1/3).
a(n) = (3^n/n!)*A007559(n), n >= 1, a(0) := 1.
a(n) ~ Gamma(1/3)^-1*n^(-2/3)*3^(2*n)*{1 - 1/9*n^-1 + ...}.
Representation as n-th moment of a positive function on (0, 9): a(n) = Integral_{x=0..9} ( x^n*(1/(Pi*sqrt(3)*6*(x/9)^(2/3)*(1-x/9)^(1/3))) ), n >= 0. This function is the solution of the Hausdorff moment problem on (0, 9) with moments equal to a(n). As a consequence this representation is unique. - Karol A. Penson, Jan 30 2003
D-finite with recurrence: n*a(n) + 3*(2-3*n)*a(n-1)=0. - R. J. Mathar, Jun 07 2013
0 = a(n) * (81*a(n+1) - 15*a(n+2)) + a(n+1) * (-3*a(n+1) + a(n+2)) for all n in Z. - Michael Somos, Jan 27 2014
G.f. A(x)=:y satisfies 0 = y'' * y - 4 * y' * y'. - Michael Somos, Jan 27 2014
a(n) = (-9)^n*binomial(-1/3, n). - Peter Luschny, Mar 23 2014
E.g.f.: is the hypergeometric function of type 1F1, in Maple notation hypergeom([1/3], [1], 9*x). - Karol A. Penson, Dec 19 2015
Sum_{n>=0} 1/a(n) = (sqrt(3)*Pi + 3*(12 + log(3)))/32 = 1.3980385924595932... - Ilya Gutkovskiy, Jul 01 2016
Binomial transform of A216316. - Peter Bala, Jul 02 2023
From Peter Bala, Mar 31 2024: (Start)
a(n) = (9^n)*Sum_{k = 0..2*n} (-1)^k*binomial(-1/3, k)* binomial(-1/3, 2*n - k).
(9^n)*a(n) = Sum_{k = 0..2*n} (-1)^k*a(k)*a(2*n-k).
Sum_{k = 0..n} a(k)*a(n-k) = A004988(n).
Sum_{k = 0..2*n} a(k)*a(2*n-k) = 18^n/(2*n)! * Product_{k = 1..n} (6*k - 1)*(3*k - 2). (End)
G.f. A(x) satisfies A(x) = 1/A(-x*A(x)^3). - Seiichi Manyama, Jun 20 2025

Extensions

More terms from Ralf Stephan, Mar 13 2004
More terms from Benoit Cloitre, Jun 05 2004

A256890 Triangle T(n,k) = t(n-k, k); t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.

Original entry on oeis.org

1, 2, 2, 4, 12, 4, 8, 52, 52, 8, 16, 196, 416, 196, 16, 32, 684, 2644, 2644, 684, 32, 64, 2276, 14680, 26440, 14680, 2276, 64, 128, 7340, 74652, 220280, 220280, 74652, 7340, 128, 256, 23172, 357328, 1623964, 2643360, 1623964, 357328, 23172, 256, 512, 72076, 1637860, 10978444, 27227908, 27227908, 10978444, 1637860, 72076, 512
Offset: 0

Views

Author

Dale Gerdemann, Apr 12 2015

Keywords

Comments

Related triangles may be found by varying the function f(x). If f(x) is a linear function, it can be parameterized as f(x) = a*x + b. With different values for a and b, the following triangles are obtained:
a\b 1.......2.......3.......4.......5.......6
The row sums of these, and similarly constructed number triangles, are shown in the following table:
a\b 1.......2.......3.......4.......5.......6.......7.......8.......9
The formula can be further generalized to: t(n,m) = f(m+s)*t(n-1,m) + f(n-s)*t(n,m-1), where f(x) = a*x + b. The following table specifies triangles with nonzero values for s (given after the slash).
a\b 0 1 2 3
-2 A130595/1
-1
0
With the absolute value, f(x) = |x|, one obtains A038221/3, A038234/4, A038247/5, A038260/6, A038273/7, A038286/8, A038299/9 (with value for s after the slash).
If f(x) = A000045(x) (Fibonacci) and s = 1, the result is A010048 (Fibonomial).
In the notation of Carlitz and Scoville, this is the triangle of generalized Eulerian numbers A(r, s | alpha, beta) with alpha = beta = 2. Also the array A(2,1,4) in the notation of Hwang et al. (see page 31). - Peter Bala, Dec 27 2019

Examples

			Array, t(n, k), begins as:
   1,    2,      4,        8,        16,         32,          64, ...;
   2,   12,     52,      196,       684,       2276,        7340, ...;
   4,   52,    416,     2644,     14680,      74652,      357328, ...;
   8,  196,   2644,    26440,    220280,    1623964,    10978444, ...;
  16,  684,  14680,   220280,   2643360,   27227908,   251195000, ...;
  32, 2276,  74652,  1623964,  27227908,  381190712,  4677894984, ...;
  64, 7340, 357328, 10978444, 251195000, 4677894984, 74846319744, ...;
Triangle, T(n, k), begins as:
    1;
    2,     2;
    4,    12,      4;
    8,    52,     52,       8;
   16,   196,    416,     196,      16;
   32,   684,   2644,    2644,     684,      32;
   64,  2276,  14680,   26440,   14680,    2276,     64;
  128,  7340,  74652,  220280,  220280,   74652,   7340,   128;
  256, 23172, 357328, 1623964, 2643360, 1623964, 357328, 23172,   256;
		

Crossrefs

Programs

  • Magma
    A256890:= func< n,k | (&+[(-1)^(k-j)*Binomial(j+3,j)*Binomial(n+4,k-j)*(j+2)^n: j in [0..k]]) >;
    [A256890(n,k): k in [0..n], n in [0..10]]; // G. C. Greubel, Oct 18 2022
    
  • Mathematica
    Table[Sum[(-1)^(k-j)*Binomial[j+3, j] Binomial[n+4, k-j] (j+2)^n, {j,0,k}], {n,0, 9}, {k,0,n}]//Flatten (* Michael De Vlieger, Dec 27 2019 *)
  • PARI
    t(n,m) = if ((n<0) || (m<0), 0, if ((n==0) && (m==0), 1, (m+2)*t(n-1, m) + (n+2)*t(n, m-1)));
    tabl(nn) = {for (n=0, nn, for (k=0, n, print1(t(n-k, k), ", ");); print(););} \\ Michel Marcus, Apr 14 2015
    
  • SageMath
    def A256890(n,k): return sum((-1)^(k-j)*Binomial(j+3,j)*Binomial(n+4,k-j)*(j+2)^n for j in range(k+1))
    flatten([[A256890(n,k) for k in range(n+1)] for n in range(11)]) # G. C. Greubel, Oct 18 2022

Formula

T(n,k) = t(n-k, k); t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0 else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), where f(x) = x + 2.
Sum_{k=0..n} T(n, k) = A001715(n).
T(n,k) = Sum_{j = 0..k} (-1)^(k-j)*binomial(j+3,j)*binomial(n+4,k-j)*(j+2)^n. - Peter Bala, Dec 27 2019
Modified rule of Pascal: T(0,0) = 1, T(n,k) = 0 if k < 0 or k > n else T(n,k) = f(n-k) * T(n-1,k-1) + f(k) * T(n-1,k), where f(x) = x + 2. - Georg Fischer, Nov 11 2021
From G. C. Greubel, Oct 18 2022: (Start)
T(n, n-k) = T(n, k).
T(n, 0) = A000079(n). (End)

A004117 Numerators of expansion of (1-x)^(-1/3).

Original entry on oeis.org

1, 1, 2, 14, 35, 91, 728, 1976, 5434, 135850, 380380, 1071980, 9111830, 25933670, 74096200, 637227320, 1832028545, 5280552865, 137294374490, 397431084050, 1152550143745, 10043651252635, 29217894553120, 85112997176480
Offset: 0

Views

Author

Keywords

Comments

For n >= 1, a(n) is also the numerator of beta(n+1/3,2/3)*sqrt(27)/(2*Pi). - Groux Roland, May 17 2011

Crossrefs

Programs

  • Mathematica
    Table[Numerator[Binomial[-1/3,n] (-1)^n],{n,0,40}] (* Vincenzo Librandi, Jun 13 2012 *)
  • PARI
    a(n)=prod(k=1,n,3*k-2)/n!*3^sum(k=1,n,valuation(k,3))

Formula

(1/n!) * 3^A054861(n) * Product_{k=0..n-1} (3k+1). - Ralf Stephan, Mar 13 2004
Numerators in (1-3t)^(-1/3) = 1 + t + 2*t^2 + (14/3)*t^3 + (35/3)*t^4 + (91/3)*t^5 + (728/9)*t^6 + (1976/9)*t^7 + (5434/9)*t^8 + ... = 1 + t + 4*t^2/2! + 28*t^3/3! + 280*t^4/4! + 3640*t^5/5! + 58240*t^6/6! + ... = e.g.f. for triple factorials A007559 (cf. A094638). - Tom Copeland, Dec 04 2013

Extensions

Typo in formula fixed by Pontus von Brömssen, Nov 25 2008

A053103 a(n) = ((6*n+10)(!^6))/10(!^6), related to A034724 (((6*n+4)(!^6))/4 sextic, or 6-factorials).

Original entry on oeis.org

1, 16, 352, 9856, 335104, 13404160, 616591360, 32062750720, 1859639541760, 119016930672640, 8331185147084800, 633170071178444800, 51919945836632473600, 4568955233623657676800, 429481791960623821619200
Offset: 0

Views

Author

Keywords

Comments

Row m=10 of the array A(7; m,n) := ((6*n+m)(!^6))/m(!^6), m >= 0, n >= 0.

Crossrefs

Cf. A047058, A008542(n+1), A034689(n+1), A034723(n+1), A034724(n+1), A034787(n+1), A034788(n+1), A053100, A053101, A053102, this sequence (rows m=0..10).

Programs

  • Magma
    m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1-6*x)^(8/3))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 16 2018
  • Mathematica
    s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 15, 5!, 6}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
    With[{nn = 30}, CoefficientList[Series[1/(1 - 6*x)^(16/6), {x, 0, nn}], x]*Range[0, nn]!] (* G. C. Greubel, Aug 16 2018 *)
  • PARI
    x='x+O('x^30); Vec(serlaplace(1/(1-6*x)^(8/3))) \\ G. C. Greubel, Aug 16 2018
    

Formula

a(n) = ((6*n+10)(!^6))/10(!^6) = A034724(n+2)/10.
E.g.f.: 1/(1-6*x)^(8/3).

A053100 a(n) = ((6*n+7)(!^6))/7, related to A008542 ((6*n+1)(!^6) sextic, or 6-factorials).

Original entry on oeis.org

1, 13, 247, 6175, 191425, 7082725, 304557175, 14923301575, 820781586625, 50067676784125, 3354534344536375, 244881007151155375, 19345599564941274625, 1644375963020008343125, 149638212634820759224375
Offset: 0

Views

Author

Keywords

Comments

Row m=7 of the array A(7; m,n) := ((6*n+m)(!^6))/m(!^6), m >= 0, n >= 0.

Crossrefs

Cf. A047058, A008542(n+1), A034689(n+1), A034723(n+1), A034724(n+1), A034787(n+1), A034788(n+1), this sequence, A053101, A053102, A053103 (rows m=0..10).

Programs

  • Magma
    m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1-6*x)^(13/6))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 15 2018
  • Mathematica
    s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 12, 5!, 6}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
    With[{nn=20},CoefficientList[Series[1/(1-6x)^(13/6),{x,0,nn}],x] Range[0,nn]!] (* Harvey P. Dale, Apr 20 2015 *)
  • PARI
    x='x+O('x^30); Vec(serlaplace(1/(1-6*x)^(13/6))) \\ G. C. Greubel, Aug 15 2018
    

Formula

a(n) = ((6*n+7)(!^6))/7(!^6) = A008542(n+2)/7.
E.g.f.: 1/(1-6*x)^(13/6).

A053102 a(n) = ((6*n+9)(!^6))/9(!^6), related to A034723 (((6*n+3)(!^6))/3 sextic, or 6-factorials).

Original entry on oeis.org

1, 15, 315, 8505, 280665, 10945935, 492567075, 25120920825, 1431892487025, 90209226682575, 6224436641097675, 466832748082325625, 37813452594668375625, 3289770375736148679375, 305948644943461827181875
Offset: 0

Views

Author

Keywords

Comments

Row m=9 of the array A(7; m,n) := ((6*n+m)(!^6))/m(!^6), m >= 0, n >= 0.

Crossrefs

Cf. A047058, A008542(n+1), A034689(n+1), A034723(n+1), A034724(n+1), A034787(n+1), A034788(n+1), A053100, A053101, this sequence, A053103 (rows m=0..10).

Programs

  • Magma
    m:=30; R:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!(1/(1-6*x)^(15/6))); [Factorial(n-1)*b[n]: n in [1..m]]; // G. C. Greubel, Aug 15 2018
  • Mathematica
    s=1;lst={s};Do[s+=n*s;AppendTo[lst, s], {n, 14, 5!, 6}];lst (* Vladimir Joseph Stephan Orlovsky, Nov 08 2008 *)
    With[{nn = 30}, CoefficientList[Series[1/(1 - 6*x)^(15/6), {x, 0, nn}], x]*Range[0, nn]!] (* G. C. Greubel, Aug 15 2018 *)
  • PARI
    x='x+O('x^30); Vec(serlaplace(1/(1-6*x)^(15/6))) \\ G. C. Greubel, Aug 15 2018
    

Formula

a(n) = ((6*n+9)(!^6))/9(!^6) = A034723(n+2)/9.
E.g.f.: 1/(1-6*x)^(15/6).

A172455 The case S(6,-4,-1) of the family of self-convolutive recurrences studied by Martin and Kearney.

Original entry on oeis.org

1, 7, 84, 1463, 33936, 990542, 34938624, 1445713003, 68639375616, 3676366634402, 219208706540544, 14397191399702118, 1032543050697424896, 80280469685284582812, 6725557192852592984064, 603931579625379293509683
Offset: 1

Views

Author

N. J. A. Sloane, Nov 20 2010

Keywords

Examples

			G.f. = x + 7*x^2 + 84*x^3 + 1463*x^4 + 33936*x^5 + 990542*x^6 + 34938624*x^7 + ...
a(2) = 7 since (6*2 - 4) * a(2-1) - (a(1) * a(2-1)) = 7.
		

Crossrefs

Cf. A000079 S(1,1,-1), A000108 S(0,0,1), A000142 S(1,-1,0), A000244 S(2,1,-2), A000351 S(4,1,-4), A000400 S(5,1,-5), A000420 S(6,1,-6), A000698 S(2,-3,1), A001710 S(1,1,0), A001715 S(1,2,0), A001720 S(1,3,0), A001725 S(1,4,0), A001730 S(1,5,0), A003319 S(1,-2,1), A005411 S(2,-4,1), A005412 S(2,-2,1), A006012 S(-1,2,2), A006318 S(0,1,1), A047891 S(0,2,1), A049388 S(1,6,0), A051604 S(3,1,0), A051605 S(3,2,0), A051606 S(3,3,0), A051607 S(3,4,0), A051608 S(3,5,0), A051609 S(3,6,0), A051617 S(4,1,0), A051618 S(4,2,0), A051619 S(4,3,0), A051620 S(4,4,0), A051621 S(4,5,0), A051622 S(4,6,0), A051687 S(5,1,0), A051688 S(5,2,0), A051689 S(5,3,0), A051690 S(5,4,0), A051691 S(5,5,0), A053100 S(6,1,0), A053101 S(6,2,0), A053102 S(6,3,0), A053103 S(6,4,0), A053104 S(7,1,0), A053105 S(7,2,0), A053106 S(7,3,0), A062980 S(6,-8,1), A082298 S(0,3,1), A082301 S(0,4,1), A082302 S(0,5,1), A082305 S(0,6,1), A082366 S(0,7,1), A082367 S(0,8,1), A105523 S(0,-2,1), A107716 S(3,-4,1), A111529 S(1,-3,2), A111530 S(1,-4,3), A111531 S(1,-5,4), A111532 S(1,-6,5), A111533 S(1,-7,6), A111546 S(1,0,1), A111556 S(1,1,1), A143749 S(0,10,1), A146559 S(1,1,-2), A167872 S(2,-3,2), A172450 S(2,0,-1), A172485 S(-1,-2,3), A177354 S(1,2,1), A292186 S(4,-6,1), A292187 S(3, -5, 1).

Programs

  • Mathematica
    a[1] = 1; a[n_]:= a[n] = (6*n-4)*a[n-1] - Sum[a[k]*a[n-k], {k, 1, n-1}]; Table[a[n], {n, 1, 20}] (* Vaclav Kotesovec, Jan 19 2015 *)
  • PARI
    {a(n) = local(A); if( n<1, 0, A = vector(n); A[1] = 1; for( k=2, n, A[k] = (6 * k - 4) * A[k-1] - sum( j=1, k-1, A[j] * A[k-j])); A[n])} /* Michael Somos, Jul 24 2011 */
    
  • PARI
    S(v1, v2, v3, N=16) = {
      my(a = vector(N)); a[1] = 1;
      for (n = 2, N, a[n] = (v1*n+v2)*a[n-1] + v3*sum(j=1,n-1,a[j]*a[n-j])); a;
    };
    S(6,-4,-1)
    \\ test: y = x*Ser(S(6,-4,-1,201)); 6*x^2*y' == y^2 - (2*x-1)*y - x
    \\ Gheorghe Coserea, May 12 2017

Formula

a(n) = (6*n - 4) * a(n-1) - Sum_{k=1..n-1} a(k) * a(n-k) if n>1. - Michael Somos, Jul 24 2011
G.f.: x / (1 - 7*x / (1 - 5*x / (1 - 13*x / (1 - 11*x / (1 - 19*x / (1 - 17*x / ... )))))). - Michael Somos, Jan 03 2013
a(n) = 3/(2*Pi^2)*int((4*x)^((3*n-1)/2)/(Ai'(x)^2+Bi'(x)^2), x=0..inf), where Ai'(x), Bi'(x) are the derivatives of the Airy functions. [Vladimir Reshetnikov, Sep 24 2013]
a(n) ~ 6^n * (n-1)! / (2*Pi) [Martin + Kearney, 2011, p.16]. - Vaclav Kotesovec, Jan 19 2015
6*x^2*y' = y^2 - (2*x-1)*y - x, where y(x) = Sum_{n>=1} a(n)*x^n. - Gheorghe Coserea, May 12 2017
G.f.: x/(1 - 2*x - 5*x/(1 - 7*x/(1 - 11*x/(1 - 13*x/(1 - ... - (6*n - 1)*x/(1 - (6*n + 1)*x/(1 - .... Cf. A062980. - Peter Bala, May 21 2017
Showing 1-7 of 7 results.