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

A028338 Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.

Original entry on oeis.org

1, 1, 1, 3, 4, 1, 15, 23, 9, 1, 105, 176, 86, 16, 1, 945, 1689, 950, 230, 25, 1, 10395, 19524, 12139, 3480, 505, 36, 1, 135135, 264207, 177331, 57379, 10045, 973, 49, 1, 2027025, 4098240, 2924172, 1038016, 208054, 24640, 1708, 64, 1, 34459425, 71697105, 53809164, 20570444, 4574934, 626934, 53676, 2796, 81, 1
Offset: 0

Views

Author

Keywords

Comments

Exponential Riordan array (1/sqrt(1-2*x), log(1/sqrt(1-2*x))). - Paul Barry, May 09 2011
The o.g.f.s D(d, x) of the column sequences, for d, d >= 0,(d=0 for the main diagonal) are P(d, x)/(1 - x)^(2*d+1), with the row polynomial P(d, x) = Sum_{m=0..d} A288875(d, m)*x^m. See A288875 for details. - Wolfdieter Lang, Jul 21 2017

Examples

			G.f. for n = 4: (x + 1)*(x + 3)*(x + 5)*(x + 7) = 105 + 176*x + 86*x^2 + 16*x^3 + x^4.
The triangle T(n, k) begins:
n\k       0        1        2        3       4      5     6    7  8  9
0:        1
1:        1        1
2:        3        4        1
3:       15       23        9        1
4:      105      176       86       16       1
5:      945     1689      950      230      25      1
6:    10395    19524    12139     3480     505     36     1
7:   135135   264207   177331    57379   10045    973    49    1
8:  2027025  4098240  2924172  1038016  208054  24640  1708   64  1
9: 34459425 71697105 53809164 20570444 4574934 626934 53676 2796 81  1
...
row n = 10: 654729075 1396704420 1094071221 444647600 107494190 16486680 1646778 106800 4335 100 1.
...  reformatted and extended. - _Wolfdieter Lang_, May 09 2017
O.g.f.s of diagonals d >= 0: D(2, x) = (3 + 8*x + x^2)/(1 - x)^5 generating [3, 23, 86, ...] = A024196(n+1), from the row d=2 entries of A288875 [3, 8, 1]. - _Wolfdieter Lang_, Jul 21 2017
Boas-Buck recurrence for column k=2 and n=4: T(4, 2) = (4!/2)*(2*(1+4*(5/12))*T(2,2)/2! + 1*(1 + 4*(1/2))*T(3,2)/3!) = (4!/2)*(8/3*1 + 3*9/3!) = 86. - _Wolfdieter Lang_, Aug 11 2017
		

Crossrefs

A039757 is signed version.
Row sums: A000165.
Diagonals: A000012, A000290(n+1), A024196(n+1), A024197(n+1), A024198(n+1).
A161198 is a scaled triangle version and A109692 is a transposed triangle version.
Central terms: A293318.
Cf. A286718, A002208(n+1)/A002209(n+1).

Programs

  • Maple
    nmax:=8; for n from 0 to nmax do a(n, 0) := doublefactorial(2*n-1) od: for n from 0 to nmax do a(n, n) := 1 od: for n from 2 to nmax do for m from 1 to n-1 do a(n, m) := (2*n-1)*a(n-1, m) + a(n-1, m-1) od; od: seq(seq(a(n, m), m=0..n), n=0..nmax); # Johannes W. Meijer, Jun 08 2009, revised Nov 25 2012
  • Mathematica
    T[n_, k_] := Sum[(-2)^(n-i) Binomial[i, k] StirlingS1[n, i], {i, k, n}] (* Woodhouse *)
    Join[{1},Flatten[Table[CoefficientList[Expand[Times@@Table[x+i,{i,1,2n+1,2}]],x],{n,0,10}]]] (* Harvey P. Dale, Jan 29 2013 *)

Formula

Triangle T(n, k), read by rows, given by [1, 2, 3, 4, 5, 6, 7, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, ...] where DELTA is the operator defined in A084938. - Philippe Deléham, Feb 20 2005
T(n, k) = Sum_{i=k..n} (-2)^(n-i) * binomial(i, k) * s(n, i) where s(n, k) are signed Stirling numbers of the first kind. - Francis Woodhouse (fwoodhouse(AT)gmail.com), Nov 18 2005
G.f. of row polynomials in y: 1/(1-(x+x*y)/(1-2*x/(1-(3*x+x*y)/(1-4*x/(1-(5*x+x*y)/(1-6*x*y/(1-... (continued fraction). - Paul Barry, Feb 07 2009
T(n, m) = (2*n-1)*T(n-1,m) + T(n-1,m-1) with T(n, 0) = (2*n-1)!! and T(n, n) = 1. - Johannes W. Meijer, Jun 08 2009
From Wolfdieter Lang, May 09 2017: (Start)
E.g.f. of row polynomials in y: (1/sqrt(1-2*x))*exp(-y*log(sqrt(1-2*x))) = exp(-(1+y)*log(sqrt(1-2*x))) = 1/sqrt(1-2*x)^(1+y).
E.g.f. of column m sequence: (1/sqrt(1-2*x))* (-log(sqrt(1-2*x)))^m/m!. For the special Sheffer, also known as exponential Riordan array, see a comment above. (End)
Boas-Buck type recurrence for column sequence k: T(n, k) = (n!/(n - k)) * Sum_{p=k..n-1} 2^(n-1-p)*(1 + 2*k*beta(n-1-p))*T(p, k)/p!, for n > k >= 0, with input T(k, k) = 1, and beta(k) = A002208(k+1)/A002209(k+1). See a comment and references in A286718. - Wolfdieter Lang, Aug 09 2017

A161198 Triangle of polynomial coefficients related to the series expansions of (1-x)^((-1-2*n)/2).

Original entry on oeis.org

1, 1, 2, 3, 8, 4, 15, 46, 36, 8, 105, 352, 344, 128, 16, 945, 3378, 3800, 1840, 400, 32, 10395, 39048, 48556, 27840, 8080, 1152, 64, 135135, 528414, 709324, 459032, 160720, 31136, 3136, 128
Offset: 0

Views

Author

Johannes W. Meijer, Jun 08 2009, Jul 22 2011

Keywords

Comments

The series expansion of (1-x)^((-1-2*n)/2) = sum(b(p)*x^p, p=0..infinity) for n = 0, 1, 2, .. can be described with b(p) = (F(p,n)/ (2*n-1)!!)*(binomial(2*p,p)/4^(p)) with F(x,n) = 2^n * product( x+(2*k-1)/2, k=1..n). The roots of the F(x,n) polynomials can be found at p = (1-2*k)/2 with k from 1 to n for n = 0, 1, 2, .. . The coefficients of the F(x,n) polynomials lead to the triangle given above. The triangle row sums lead to A001147.
Quite surprisingly we discovered that sum(b(p)*x^p, p=0..infinity) = (1-x)^(-1-2*n)/2, for n = -1, -2, .. . We assume that if m = n+1 then the value returned for product(f(k), k = m..n) is 1 and if m> n+1 then 1/product(f(k), k=n+1..m-1) is the value returned. Furthermore (1-2*n)!! = (-1)^(n+1)/(2*n-3)!! for n = 1, 2, 3 .. . This leads to b(p) = ((-1-2*n)!!/ G(p,n))*(binomial(2*p,p) /4^(p)) for n = -1, -2, .. . For the G(p,n) polynomials we found that G(p,n) = F(-p,-n). The roots of the G(p,n) polynomials can be found at p=(2*k-1)/2 with k from 1 to (-n) for n = -1, -2, .. . The coefficients of the G(p,n) polynomials lead to a second triangle that stands with its head on top of the first one. It is remarkable that the row sums lead once again to A001147.
These two triangles together look like an hourglass so we propose to call the F(p,n) and the G(p,n) polynomials the hourglass polynomials.
Triangle T(n,k), read by rows, given by (1, 2, 3, 4, 5, 6, 7, 8, 9, ...) DELTA (2, 0, 2, 0, 2, 0, 2, 0, 2, ...) where DELTA is the operator defined in A084938. Philippe Deléham, May 14 2015.

Examples

			From _Gary W. Adamson_, Jul 19 2011: (Start)
The first few rows of matrix M are:
  1, 2,  0,  0, 0, ...
  1, 3,  2,  0, 0, ...
  1, 4,  5,  2, 0, ...
  1, 5,  9,  7, 2, ...
  1, 6, 14, 16, 9, ... (End)
The first few G(p,n) polynomials are:
  G(p,-3) = 15 - 46*p + 36*p^2 - 8*p^3
  G(p,-2) = 3 - 8*p + 4*p^2
  G(p,-1) = 1 - 2*p
The first few F(p,n) polynomials are:
  F(p,0) = 1
  F(p,1) = 1 + 2*p
  F(p,2) = 3 + 8*p + 4*p^2
  F(p,3) = 15 + 46*p + 36*p^2 + 8*p^3
The first few rows of the upper and lower hourglass triangles are:
  [15, -46, 36, -8]
  [3, -8, 4]
  [1, -2]
  [1]
  [1, 2]
  [3, 8, 4]
  [15, 46, 36, 8]
		

Crossrefs

Cf. A001790 [(1-x)^(-1/2)], A001803 [(1-x)^(-3/2)], A161199 [(1-x)^(-5/2)] and A161201 [(1-x)^(-7/2)].
Cf. A002596 [(1-x)^(1/2)], A161200 [(1-x)^(3/2)] and A161202 [(1-x)^(5/2)].
A046161 gives the denominators of the series expansions of all (1-x)^((-1-2*n)/2).
A028338 is a scaled triangle version, A039757 is a scaled signed triangle version and A109692 is a transposed scaled triangle version.
A001147 is the first left hand column and equals the row sums.
A004041 is the second left hand column divided by 2, A028339 is the third left hand column divided by 4, A028340 is the fourth left hand column divided by 8, A028341 is the fifth left hand column divided by 16.
A000012, A000290, A024196, A024197 and A024198 are the first (n-m=0), second (n-m=1), third (n-m=2), fourth (n-m=3) and fifth (n-m=4) right hand columns divided by 2^m.
A074599 * A025549 is not always equals the second left hand column.
Cf. A029635. [Gary W. Adamson, Jul 19 2011]

Programs

  • Maple
    nmax:=7; for n from 0 to nmax do a(n,n):=2^n: a(n,0):=doublefactorial(2*n-1) od: for n from 2 to nmax do for m from 1 to n-1 do a(n,m) := 2*a(n-1,m-1)+(2*n-1)*a(n-1,m) od: od: seq(seq(a(n,k), k=0..n), n=0..nmax);
    nmax:=7: M := Matrix(1..nmax+1,1..nmax+1): A029635 := proc(n,k): binomial(n,k) + binomial(n-1,k-1) end: for i from 1 to nmax do for j from 1 to i+1 do M[i,j] := A029635(i,j-1) od: od: for n from 0 to nmax do B := M^n: for m from 0 to n do a(n,m):= B[1,m+1] od: od: seq(seq(a(n,m), m=0..n), n=0..nmax);
    A161198 := proc(n,k) option remember; if k > n or k < 0 then 0 elif n = 0 and k = 0 then 1 else 2*A161198(n-1, k-1) + (2*n-1)*A161198(n-1, k) fi end:
    seq(print(seq(A161198(n,k), k = 0..n)), n = 0..6);  # Peter Luschny, May 09 2013
  • Mathematica
    nmax = 7; a[n_, 0] := (2*n-1)!!; a[n_, n_] := 2^n; a[n_, m_] := a[n, m] = 2*a[n-1, m-1]+(2*n-1)*a[n-1, m]; Table[a[n, m], {n, 0, nmax}, {m, 0, n}] // Flatten (* Jean-François Alcover, Feb 25 2014, after Maple *)
  • PARI
    for(n=0,9, print(Vec(Ser( 2^n*prod( k=1,n, x+(2*k-1)/2 ),,n+1))))  \\ M. F. Hasler, Jul 23 2011
    
  • Sage
    @CachedFunction
    def A161198(n,k):
        if k > n or k < 0 : return 0
        if n == 0 and k == 0: return 1
        return 2*A161198(n-1,k-1)+(2*n-1)*A161198(n-1,k)
    for n in (0..6): [A161198(n,k) for k in (0..n)]  # Peter Luschny, May 09 2013

Formula

a(n,m) := coeff(2^(n)*product((x+(2*k-1)/2),k=1..n), x, m) for n = 0, 1, .. ; m = 0, 1, .. .
a(n, m) = 2*a(n-1,m-1)+(2*n-1)*a(n-1,m) with a(n, n) = 2^n and a(n, 0) = (2*n-1)!!.
a(n,m) = the (m+1)-th term in the top row of M^n, where M is an infinite square production matrix; M[i,j] = A029635(i,j-1) = binomial(i, j-1) + binomial(i-1, j-2) with A029635 the (1.2)-Pascal triangle, see the examples and second Maple program. [Gary W. Adamson, Jul 19 2011]
T(n,k) = 2^k * A028338(n,k). - Philippe Deléham, May 14 2015

A004041 Scaled sums of odd reciprocals: a(n) = (2*n + 1)!!*(Sum_{k=0..n} 1/(2*k + 1)).

Original entry on oeis.org

1, 4, 23, 176, 1689, 19524, 264207, 4098240, 71697105, 1396704420, 29985521895, 703416314160, 17901641997225, 491250187505700, 14459713484342175, 454441401368236800, 15188465029114325025, 537928935889764226500
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org)

Keywords

Comments

n-th elementary symmetric function of the first n+1 odd positive integers.
Also the determinant of the n X n matrix given by m(i,j) = 2*i + 2 = if i = j and otherwise 1. For example, Det[{{4, 1, 1, 1, 1, 1}, {1, 6, 1, 1, 1, 1}, {1, 1, 8, 1, 1, 1}, {1, 1, 1, 10, 1, 1}, {1, 1, 1, 1, 12, 1}, {1, 1, 1, 1, 1, 14}}] = 264207 = a(6). - John M. Campbell, May 20 2011

Examples

			(arctanh(x))^2 = x^2 + 2/3*x^4 + 23/45*x^6 + 44/105*x^8 + ...
		

Crossrefs

Cf. A002428.
From Johannes W. Meijer, Jun 08 2009: (Start)
Equals second left hand column of A028338 triangle.
Equals second right hand column of A109692 triangle.
Equals second left hand column of A161198 triangle divided by 2.
(End)

Programs

  • Mathematica
    Table[(-1)^(n + 1)* Sum[(-2)^(n - k) k (-1)^(n - k) StirlingS1[n + 1, k + 1], {k, 0, n}], {n, 1, 18}] (* Zerinvary Lajos, Jul 08 2009 *)
    FunctionExpand@Table[(2 n + 1)!! (Log[4] + HarmonicNumber[n + 1/2])/2, {n, 0, 20}] (* Vladimir Reshetnikov, Oct 13 2016 *)

Formula

a(n) = (2*n + 1)!!*(Sum_{k=0..n} 1/(2*k + 1)).
a(n) is coefficient of x^(2*n+2) in (arctanh x)^2, multiplied by (n + 1)*(2*n + 1)!!.
a(n) = Sum_{i=k+1..n} (-1)^(k+1-i)*2^(n-1)*binomial(i-1, k)*s1(n, i) with k = 1, where s1(n, i) are unsigned Stirling numbers of the first kind. - Victor Adamchik (adamchik(AT)ux10.sp.cs.cmu.edu), Jan 23 2001
a(n) ~ 2^(1/2)*log(n)*n*(2n/e)^n. - Joe Keane (jgk(AT)jgk.org), Jun 06 2002
E.g.f.: 1/2*(1 - 2*x)^(-3/2)*(2 - log(1 - 2*x)). - Vladeta Jovovic, Feb 19 2003
Sum_{n>=1} a(n-1)/(n!*n*2^n) = (Pi/2)^2. - Philippe Deléham, Aug 12 2003
For n >= 1, a(n-1) = 2^(n-1)*n!*(Sum_{k=0..n-1} (-1)^k*binomial(1/2, k)/(n - k)). - Milan Janjic, Dec 14 2008
Recurrence: a(n) = 4*n*a(n-1) - (2*n - 1)^2*a(n-2). - Vladimir Reshetnikov, Oct 13 2016

A039757 Triangle of coefficients in expansion of (x-1)*(x-3)*(x-5)*...*(x-(2*n-1)).

Original entry on oeis.org

1, -1, 1, 3, -4, 1, -15, 23, -9, 1, 105, -176, 86, -16, 1, -945, 1689, -950, 230, -25, 1, 10395, -19524, 12139, -3480, 505, -36, 1, -135135, 264207, -177331, 57379, -10045, 973, -49, 1, 2027025, -4098240, 2924172, -1038016, 208054, -24640, 1708, -64, 1, -34459425, 71697105, -53809164, 20570444, -4574934, 626934, -53676, 2796, -81, 1
Offset: 0

Views

Author

Ruedi Suter (suter(AT)math.ethz.ch)

Keywords

Comments

Triangle of B-analogs of Stirling numbers of first kind.

Examples

			The triangle T(n, k) begins:
n\k        0        1         2        3        4      5      6    7   8  9
0:         1
1:        -1        1
2:         3       -4         1
3:       -15       23        -9        1
4:       105     -176        86      -16        1
5:      -945     1689      -950      230      -25      1
6:     10395   -19524     12139    -3480      505    -36      1
7:   -135135   264207   -177331    57379   -10045    973    -49    1
8:   2027025 -4098240   2924172 -1038016   208054 -24640   1708  -64   1
9: -34459425 71697105 -53809164 20570444 -4574934 626934 -53676 2796 -81  1
...
row n = 10 :654729075 -1396704420 1094071221 -444647600 107494190 -16486680 1646778 -106800 4335 -100 1
... reformatted and extended. - _Wolfdieter Lang_, May 09 2017
		

Crossrefs

A028338 is unsigned version.
From Johannes W. Meijer, Jun 08 2009: (Start)
A161198 is an unsigned scaled triangle version.
A109692 is an unsigned transposed triangle version.
A000007 equals the row sums. (End)
A000165(n)*(-1)^n (alternating row sums).

Programs

  • Maple
    nmax:=8; mmax:=nmax: for n from 0 to nmax do a(n, 0) := (-1)^n*doublefactorial(2*n-1) od: for n from 0 to nmax do a(n, n) := 1 od: for n from 2 to nmax do for m from 1 to n-1 do a(n, m) := a(n-1, m-1)-(2*n-1)*a(n-1, m) od; od: seq(seq(a(n, m), m=0..n), n=0..nmax); # Johannes W. Meijer, Jun 08 2009, revised Nov 29 2012
  • Mathematica
    a[n_, m_] := a[n, m] = a[n-1, m-1] - (2*n-1)*a[n-1, m]; a[n_, 0] := (-1)^n*(2*n-1)!!; a[n_, n_] = 1; Table[a[n, m], {n, 0, 9}, {m, 0, n}] // Flatten (* Jean-François Alcover, Oct 16 2012, after Johannes W. Meijer *)
  • PARI
    row(n)=Vecrev(prod(i=1,n,'x-2*i+1)) \\ Charles R Greathouse IV, Feb 09 2017

Formula

Triangle T(n, k), read by rows, given by [ -1, -2, -3, -4, -5, -6, -7, ...] DELTA [1, 0, 1, 0, 1, 0, 1, 0, ...], where DELTA is the operator defined in A084938. - Philippe Deléham, Feb 20 2005
a(n,m) = a(n-1,m-1) - (2*n-1)*a(n-1,m) with a(n,0) = (-1)^n*(2*n-1)!! and a(n,n) = 1. - Johannes W. Meijer, Jun 08 2009
Exponential Riordan array [1/sqrt(1 + 2*x), 1/2*log(1 + 2*x)] with e.g.f. (1 + 2*x)^((t - 1)/2) = 1 + (t-1)*x + (t-1)*(t-3)*x^2/2! + .... - Peter Bala, Jun 23 2014

A024196 a(n) = 2nd elementary symmetric function of the first n+1 odd positive integers.

Original entry on oeis.org

3, 23, 86, 230, 505, 973, 1708, 2796, 4335, 6435, 9218, 12818, 17381, 23065, 30040, 38488, 48603, 60591, 74670, 91070, 110033, 131813, 156676, 184900, 216775, 252603, 292698, 337386, 387005, 441905, 502448, 569008, 641971, 721735, 808710, 903318
Offset: 1

Views

Author

Keywords

Examples

			a(8) = 8*80+7*79+6*78+5*77+4*76+3*75+2*74+1*73 = 2796. - _Bruno Berselli_, Mar 13 2012
		

Crossrefs

From Johannes W. Meijer, Jun 08 2009: (Start)
Equals third right hand column of A028338 triangle.
Equals third left hand column of A109692 triangle.
Equals third right hand column of A161198 triangle divided by 2^m.
(End)
Cf. A016061.

Programs

  • GAP
    List([1..36], n -> n*(n+1)*(3*n^2+5*n+1)/6); # Muniru A Asiru, Feb 13 2018
  • Maple
    seq(n*(n+1)*(3*n^2+5*n+1)/6,n=1..25); # Muniru A Asiru, Feb 13 2018
  • Mathematica
    f[k_] := 2 k - 1; t[n_] := Table[f[k], {k, 1, n}]
    a[n_] := SymmetricPolynomial[2, t[n]]
    Table[a[n], {n, 2, 50}]  (* A024196 *)
    (* Clark Kimberling, Dec 31 2011 *)
    Table[(n(n+1)(3n^2+5n+1))/6,{n,50}] (* or *) LinearRecurrence[{5,-10,10,-5,1},{3,23,86,230,505},50] (* Harvey P. Dale, Jul 08 2019 *)

Formula

a(n) = n*(n+1)*(3*n^2+5*n+1)/6.
From Bruno Berselli, Mar 13 2012: (Start)
G.f.: x*(3 + 8*x + x^2)/(1 - x)^5.
a(n) = Sum_{i=1..n} (n+1-i)*((n+1)^2-i).
a(n) = n*A016061(n) - Sum_{i=0..n-1} A016061(i). (End)
a(n) - a(n-1) = A099721(n). Partial sums of A099721.- Philippe Deléham, May 07 2012
a(n) = Sum_{i=1..n} ((2*i-1)*Sum_{j=i..n} (2*j+1)) = 1*(3+5+...2*n+1) + 3*(5+7+...+2*n+1) + ... + (2*n-1)*(2*n+1). - J. M. Bergot, Apr 21 2017
a(n) = A028338(n+1, n-1), n >= 1, (third diagonal). See the crossref. below. Wolfdieter Lang, Jul 21 2017
a(n) = (A000583(n+1) - A000447(n+1))/2. - J. M. Bergot, Feb 13 2018

A293318 a(n) = (2*n)! * [x^(2*n)] (-log(sqrt(1 - 2*x)))^n/(sqrt(1 - 2*x)*n!).

Original entry on oeis.org

1, 4, 86, 3480, 208054, 16486680, 1628301884, 192666441968, 26569595376038, 4184718381424152, 741138328282003860, 145795774074768177360, 31540994233548116475196, 7442380580681963411363440, 1902155375416975061879918520, 523496081998297020687019596000
Offset: 0

Views

Author

Ilya Gutkovskiy, Oct 06 2017

Keywords

Crossrefs

Central terms of triangles A028338, A039757 (gives absolute values) and A109692.
Cf. A265846.

Programs

  • Mathematica
    Table[(2 n)! SeriesCoefficient[(-Log[Sqrt[1 - 2 x]])^n/(Sqrt[1 - 2 x] n!), {x, 0, 2 n}], {n, 0, 15}]

Formula

a(n) ~ c * d^n * (n-1)!, where d = -16*LambertW(-1, -exp(-1/2)/2)^2 / (1 + 2*LambertW(-1, -exp(-1/2)/2)) = 19.643259858273023595... (see also A265846) and c = 1/(2*Pi*sqrt(1 + 1/LambertW(-1, -exp(-1/2)/2))) = 0.2425219128152359859... - Vaclav Kotesovec, Oct 18 2017, updated Mar 17 2024 and May 14 2025

A024198 4th elementary symmetric function of the first n+3 odd positive integers.

Original entry on oeis.org

105, 1689, 12139, 57379, 208054, 626934, 1646778, 3889578, 8439783, 17085783, 32645613, 59394517, 103613692, 174281212, 283927812, 449681892, 694529781, 1048818981, 1552033791, 2254874391, 3221672146, 4533175570, 6289743070
Offset: 1

Views

Author

Keywords

Crossrefs

From Johannes W. Meijer, Jun 08 2009: (Start)
Equals fifth right hand column of A028338 triangle.
Equals fifth left hand column of A109692 triangle.
Equals fifth right hand column of A161198 triangle divided by 2^m.
(End)

Programs

  • Mathematica
    LinearRecurrence[{9,-36,84,-126,126,-84,36,-9,1},{105,1689,12139,57379,208054,626934,1646778,3889578,8439783},30] (* Harvey P. Dale, May 28 2018 *)
  • PARI
    Vec(-x*(x^4+112*x^3+718*x^2+744*x+105)/(x-1)^9 + O(x^100)) \\ Colin Barker, Aug 15 2014

Formula

a(n) = n*(n+1)*(n+2)*(n+3)*(15*n^4+150*n^3+515*n^2+672*n+223)/360.
G.f.: -x*(x^4+112*x^3+718*x^2+744*x+105) / (x-1)^9. - Colin Barker, Aug 15 2014
a(n) = A000332(n+3) * (15*n^4+150*n^3+515*n^2+672*n+223)/15 . - R. J. Mathar, Oct 01 2016
a(n) = A(n+4, n-1), n >= 1 (fifth diagonal). See a crossref. below. - Wolfdieter Lang, Jul 21 2017
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9). - Wesley Ivan Hurt, Jul 09 2025

A024197 a(n) = 3rd elementary symmetric function of the first n+2 odd positive integers.

Original entry on oeis.org

15, 176, 950, 3480, 10045, 24640, 53676, 106800, 197835, 345840, 576290, 922376, 1426425, 2141440, 3132760, 4479840, 6278151, 8641200, 11702670, 15618680, 20570165, 26765376, 34442500, 43872400, 55361475, 69254640, 85938426, 105844200, 129451505
Offset: 1

Views

Author

Keywords

Crossrefs

Contribution from Johannes W. Meijer, Jun 08 2009: (Start)
Equals fourth right hand column of A028338 triangle.
Equals fourth left hand column of A109692 triangle.
Equals fourth right hand column of A161198 triangle divided by 2^m.
(End)

Programs

  • PARI
    Vec(-x*(x^3+33*x^2+71*x+15)/(x-1)^7 + O(x^100)) \\ Colin Barker, Aug 15 2014

Formula

a(n) = n*(n+1)*(n+2)^2*(n^2+3*n+1)/6.
G.f.: -x*(x^3+33*x^2+71*x+15) / (x-1)^7. - Colin Barker, Aug 15 2014
a(n) = A004320(n)*A028387(n). - R. J. Mathar, Oct 01 2016
a(n) = A028338(n+2, n-1), n >= 1, (fourth diagonal). See a crossref. below. - Wolfdieter Lang, Jul 21 2017
Showing 1-8 of 8 results.