A038163 -id:A038163 - cp's OEIS frontend

A096338 a(n) = (2/(n-1))a(n-1) + ((n+5)/(n-1))a(n-2) with a(0)=0 and a(1)=1.

0, 1, 2, 6, 10, 20, 30, 50, 70, 105, 140, 196, 252, 336, 420, 540, 660, 825, 990, 1210, 1430, 1716, 2002, 2366, 2730, 3185, 3640, 4200, 4760, 5440, 6120, 6936, 7752, 8721, 9690, 10830, 11970, 13300, 14630, 16170, 17710, 19481, 21252, 23276, 25300, 27600

Offset: 0

Benoit Cloitre, Jun 28 2004

Without the leading zero, Poincaré series [or Poincare series] P(C_{2,2}; t).
Starting (1, 2, 6, ...) = partial sums of the tetrahedral numbers, A000292 with repeats: (1, 1, 4, 4, 10, 10, 20, 20, 35, 35, ...). - Gary W. Adamson, Mar 30 2009
Starting with 1 = [1, 2, 3, ...] convolved with the aerated triangular series, [1, 0, 3, 0, 6, ...]. - Gary W. Adamson, Jun 11 2009
From Alford Arnold, Oct 14 2009: (Start)
a(n) is also related to Dyck Paths. Note that
0 1 2 6 10 20 30 50 70 105 ...
minus
0 0 0 0 1 2 6 10 20 30 ...
equals
0 1 2 6 9 18 24 40 50 75 ... A028724
(End)
The Kn11, Kn12, Kn13, Fi1 and Ze1 triangle sums of A139600 are related to the sequence given above; e.g., Ze1(n) = 3*A096338(n-1) - 3*A096338(n-3) + 9*A096338(n-4), with A096338(n) = 0 for n <= -1. For the definition of these triangle sums, see A180662. - Johannes W. Meijer, Apr 29 2011

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Dragomir Z. Djokovic, Poincaré series [or Poincare series] of some pure and mixed trace algebras of two generic matrices, arXiv:math/0609262 [math.AC], 2006. See Table 3.
Brian Hopkins and Aram Tangboonduangjit, Water Cells in Compositions of 1s and 2s, arXiv:2412.11528 [math.CO], 2024. See p. 3.
Jia Huang, Partially Palindromic Compositions, J. Int. Seq. (2023) Vol. 26, Art. 23.4.1. See p. 4, 19.
M. Navascues and T. Vertesi, The Structure of Matrix Product States, arXiv preprint arXiv:1509.04507 [quant-ph], 2015-2018.
Miguel Navascués and Tamás Vértesi, Bond dimension witnesses and the structure of homogeneous matrix product states, Quantum 2 (2018): 50.
Index entries for linear recurrences with constant coefficients, signature (2,2,-6,0,6,-2,-2,1).

Cf. A006918, A038163, A060099, A058187, A000292, A028724.

A096338:=n->-(floor(n/2)+1)*(floor(n/2)+2)*(floor(n/2)+3)*(3*floor(n/2)-2*n)/12; seq(A096338(k),k=0..100); # Wesley Ivan Hurt, Oct 04 2013

t = {0, 1}; Do[AppendTo[t, (2/(n - 1))*t[[-1]] + ((n + 5)/(n - 1))*t[[-2]]], {n, 2, 50}]; t (* T. D. Noe, Oct 08 2013 *)
CoefficientList[Series[x/((1 - x)^2*(1 - x^2)^3), {x, 0, 45}], x] (* or *)
Nest[Append[#1, (2/(#2 - 1))*#1[[-1]] + ((#2 + 5)/(#2 - 1))*#1[[-2]] ] & @@ {#, Length@ #} &, {0, 1}, 44] (* Michael De Vlieger, May 30 2018 *)

G.f.: x/((1-x)^2*(1-x^2)^3). - Ralf Stephan, Jun 29 2004
a(n) = Sum_{k=1..floor(n/2)+1} ( Sum_{i=1..k} i*(n-2*k+2) ) = -(floor(n/2)+1) * (floor(n/2)+2) * (floor(n/2)+3) * (3*floor(n/2) - 2*n)/12. - Wesley Ivan Hurt, Sep 26 2013
a(n) = 2*a(n-1) + 2*a(n-2) - 6*a(n-3) + 6*a(n-5) - 2*a(n-6) - 2*a(n-7) + a(n-8). - Wesley Ivan Hurt, Nov 26 2020
128*a(n) = 8*n^3 +94/3*n^2 +44*n +15 +2/3*n^4 -2*(-1)^n*n^2 -12*(-1)^n*n -15*(-1)^n. - R. J. Mathar, Mar 23 2021

A005995 Alkane (or paraffin) numbers l(8,n).

Original entry on oeis.org

1, 3, 12, 28, 66, 126, 236, 396, 651, 1001, 1512, 2184, 3108, 4284, 5832, 7752, 10197, 13167, 16852, 21252, 26598, 32890, 40404, 49140, 59423, 71253, 85008, 100688, 118728, 139128, 162384, 188496, 218025, 250971, 287964, 329004, 374794, 425334, 481404, 543004

Offset: 0

N. J. A. Sloane, Winston C. Yang (yang(AT)math.wisc.edu)

From M. F. Hasler, May 01 2009: (Start)
Also, number of 5-element subsets of {1,...,n+5} whose elements sum to an odd integer, i.e. column 5 of A159916.
A linear recurrent sequence with constant coefficients and characteristic polynomial x^9 - 3*x^8 + 8*x^6 - 6*x^5 - 6*x^4 + 8*x^3 - 3*x + 1. (End)
Equals (1/2)*((1, 6, 21, 56, 126, 252, ...) + (1, 0, 3, 0, 6, 0, 10, ...)), see A000389 and A000217.
Equals row sums of triangle A160770.
F(1,5,n) is the number of bracelets with 1 blue, 5 identical red and n identical black beads. If F(1,5,1) = 3 and F(1,5,2) = 12 taken as a base, F(1,5,n) = n(n+1)(n+2)(n+3)/24 + F(1,3,n) + F(1,5,n-2). [F(1,3,n) is the number of bracelets with 1 blue, 3 identical red and n identical black beads. If F(1,3,1) = 2 and F(1,3,2) = 6 taken as a base F(1,3,n) = n(n+1)/2 + [|n/2|] + 1 + F(1,3,n-2)], where [|x|]: if a is an integer and a<=x

S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Winston C. Yang (paper in preparation).

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Johann Cigler, Some remarks on Rogers-Szegö polynomials and Losanitsch's triangle, arXiv:1711.03340 [math.CO], 2017.
S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926. (Annotated scanned copy)
N. J. A. Sloane, Classic Sequences
L. Smith, Polynomial invariants of finite groups. A survey of recent developments. Bull. Amer. Math. Soc. (N.S.) 34 (1997), no. 3, 211-250.
Ata A. Uslu and Hamdi G. Ozmenekse, F(1,3,n)
Ata A. Uslu and Hamdi G. Ozmenekse, F(1,5,n)
Index entries for linear recurrences with constant coefficients, signature (3, 0, -8, 6, 6, -8, 0, 3, -1).

Cf. A160770, A053132 (bisection), A271870 (bisection), A018210 (partial sums).

a:= n-> (Matrix([[1, 0$6, -3, -9]]). Matrix(9, (i,j)-> if (i=j-1) then 1 elif j=1 then [3, 0, -8, 6, 6, -8, 0, 3, -1][i] else 0 fi)^n)[1, 1]: seq(a(n), n=0..40); # Alois P. Heinz, Jul 31 2008

a[n_?OddQ] := 1/240*(n+1)*(n+2)*(n+3)*(n+4)*(n+5); a[n_?EvenQ] := 1/240*(n+2)*(n+4)*(n+6)*(n^2+3*n+5); Table[a[n], {n, 0, 32}] (* Jean-François Alcover, Mar 17 2014, after M. F. Hasler *)
LinearRecurrence[{3, 0, -8, 6, 6, -8, 0, 3, -1},{1, 3, 12, 28, 66, 126, 236, 396, 651},40] (* Ray Chandler, Sep 23 2015 *)

a(k)= if(k%2,(k+1)*(k+3)*(k+5),(k+6)*(k^2+3*k+5))*(k+2)*(k+4)/240 \\ M. F. Hasler, May 01 2009

G.f.: (1+3*x^2)/((1-x)^3*(1-x^2)^3).
a(2n-1) = n(n+1)(n+2)(2n+1)(2n+3)/30, a(2n) = (n+1)(n+2)(n+3)(4n^2+6n+5)/ 30. [M. F. Hasler, May 01 2009]
a(n) = (1/240)*(n+1)*(n+2)*(n+3)*(n+4)*(n+5) + (1/16)*(n+2)*(n+4)*(1/2)*(1+(-1)^n). [Yosu Yurramendi, Jun 20 2013]
a(n) = A038163(n)+3*A038163(n-2). - R. J. Mathar, Mar 29 2018

A060099 G.f.: 1/((1-x^2)^3*(1-x)^4).

Original entry on oeis.org

1, 4, 13, 32, 71, 140, 259, 448, 742, 1176, 1806, 2688, 3906, 5544, 7722, 10560, 14223, 18876, 24739, 32032, 41041, 52052, 65429, 81536, 100828, 123760, 150892, 182784, 220116, 263568, 313956, 372096, 438957, 515508, 602889, 702240, 814891, 942172, 1085623

Offset: 0

Wolfdieter Lang, Apr 06 2001

Fourth column (m=3) of triangle A060098.
Partial sums of A038163.
Equals the tetrahedral numbers, [1, 4, 10, 20, ...] convolved with the aerated triangular numbers, [1, 0, 3, 0, 6, 0, 10, ...]. [Gary W. Adamson, Jun 11 2009]

B. Broer, Hilbert series for modules of covariants, in Algebraic Groups and Their Generalizations..., Proc. Sympos. Pure Math., 56 (1994), Part I, 321-331. See p. 329.

Peter J. C. Moses, Table of n, a(n) for n = 0..9999
Jia Huang, Partially Palindromic Compositions, J. Int. Seq. (2023) Vol. 26, Art. 23.4.1. See pp. 4, 20.
Index entries for linear recurrences with constant coefficients, signature (4,-3,-8,14,0,-14,8,3,-4,1).

Cf. A002620, A002624, A096338.
Cf. A001752 (for the similar series 1/((1-x)^4*(1-x^2))).
Cf. A028346 (for the similar series 1/((1-x)^4*(1-x^2)^2)).

a[n_]:=If[OddQ[n],((1+n) (3+n) (5+n)^2 (7+n) (9+n))/5760,((2+n) (4+n) (6+n) (8+n) (15+10 n+n^2))/5760]; Map[a,Range[0,100]] (* Peter J. C. Moses, Mar 24 2013 *)
CoefficientList[Series[1/((1-x^2)^3*(1-x)^4),{x,0,100}],x] (* Peter J. C. Moses, Mar 24 2013 *)
LinearRecurrence[{4,-3,-8,14,0,-14,8,3,-4,1},{1,4,13,32,71,140,259,448,742,1176},40] (* Harvey P. Dale, Apr 06 2018 *)

a(n) = Sum_{} A060098(n+3, 3).

G.f.: 1/((1-x)^7*(1+x)^3).

A164680 Expansion of x/((1-x)^3(1-x^2)^3(1-x^3)).

Original entry on oeis.org

1, 3, 9, 20, 42, 78, 139, 231, 372, 573, 861, 1254, 1791, 2499, 3432, 4629, 6162, 8085, 10492, 13455, 17094, 21503, 26832, 33201, 40795, 49764, 60333, 72687, 87096, 103785, 123075, 145236, 170646, 199626, 232617, 269997, 312277, 359898, 413448, 473438

Offset: 1

Alford Arnold, Aug 21 2009

Convolution of A006918 with A001399, or of A002625 with A059841 (A000035 if offsets are respected),
or of A038163 with A022003 or of A057524 with A027656 or of A014125 with the aerated version of A000217,
or of A002624 with A103221, or of A002623 with A008731, or of other combinations of splitting the signature -/3,3,1 into two components.
If we apply the enumeration of Molien series as described in A139672,
this is row 45=9*5 of a table of values related to Molien series, i.e., the
product of the sequence on row 9 (A006918) with the sequence on row 5 (A001399).
This is associated with the root system E6, and can be described using the additive function on the affine E6 diagram:
      1
      |
      2
      |
1--2--3--2--1

			To calculate a(3), we consider the first three terms of A001399 = (1 1 2...)
and the first three terms of A006918 = (1 2 5 ...), to get the convolved a(3) = 1*5+1*2+2*1 = 9.

G. C. Greubel, Table of n, a(n) for n = 1..1000
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (3,0,-7,3,6,0,-6,-3,7,0,-3,1).

Cf. A139672 (row 21).
For G2, the corresponding sequence is A001399.
For F4, the corresponding sequence is A115264.
For E7, the corresponding sequence is A210068.
For E8, the corresponding sequence is A045513.
See A210634 for a closely related sequence.

R:=PowerSeriesRing(Integers(), 40); Coefficients(R!( 1/((1-x)^3*(1-x^2)^3*(1-x^3)) )); // G. C. Greubel, Jan 13 2020

seq(coeff(series(x/((1-x)^3*(1-x^2)^3*(1-x^3)), x, n+1), x, n), n = 1..40); # G. C. Greubel, Jan 13 2020

Rest@CoefficientList[Series[x/((1-x)^3*(1-x^2)^3*(1-x^3)), {x,0,40}], x] (* G. C. Greubel, Jan 13 2020 *)
LinearRecurrence[{3,0,-7,3,6,0,-6,-3,7,0,-3,1},{1,3,9,20,42,78,139,231,372,573,861,1254},40] (* Harvey P. Dale, Aug 03 2025 *)

Vec(1/(1-x)^3/(1-x^2)^3/(1-x^3)+O(x^40)) \\ Charles R Greathouse IV, Sep 23 2012

x=PowerSeriesRing(QQ, 'x', 40).gen()
1/((1-x)^3*(1-x^2)^3*(1-x^3))

a(n) = round( -(-1)^n*(n+3)*(n+7)/256 +(6*n^6 +180*n^5 +2070*n^4 +11400*n^3 +30429*n^2 +34290*n +9785)/103680 ) - R. J. Mathar, Mar 19 2012

Edited and extended by R. J. Mathar, Aug 22 2009

Corrected link to index entries - R. J. Mathar, Aug 26 2009

A059594 Convolution triangle based on A008619 (positive integers repeated).

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 5, 3, 1, 3, 8, 9, 4, 1, 3, 14, 19, 14, 5, 1, 4, 20, 39, 36, 20, 6, 1, 4, 30, 69, 85, 60, 27, 7, 1, 5, 40, 119, 176, 160, 92, 35, 8, 1, 5, 55, 189, 344, 376, 273, 133, 44, 9, 1, 6, 70, 294, 624, 820, 714, 434

Offset: 0

Wolfdieter Lang, Feb 02 2001

In the language of the Shapiro et al. reference (given in A053121) such a lower triangular (ordinary) convolution array, considered as a matrix, belongs to the Bell-subgroup of the Riordan-group.
The G.f. for the row polynomials p(n,x) = Sum_{m=0..n} a(n,m)*x^m is 1/((1-z^2)*(1-z)-x*z).
The column sequences are A008619(n); A006918(n); A038163(n-2), n >= 2; A038164(n-3), n >= 3; A038165(n-4), n >= 4; A038166(n-5), n >= 5; A059595(n-6), n >= 6; A059596(n-7), n >= 7; A059597(n-8), n >= 8; A059598(n-9), n >= 9; A059625(n-10), n >= 10 for m=0..10.
The sequence of row sums is A006054(n+2).
From Gary W. Adamson, Aug 14 2016: (Start)
The sequence can be generated by extracting the descending antidiagonals of an array formed by taking powers of the natural integers with repeats, (1, 1, 2, 2, 3, 3, ...), as follows:
  1, 1,  2,  2,  3,   3, ...
  1, 2,  5,  8, 14,  20, ...
  1, 3,  9, 19, 39,  69, ...
  1, 4, 14, 36, 85, 176, ...
  ...
Row sums of the triangle = (1, 2, 5, 11, 25, 56, ...), the INVERT transform of (1, 1, 2, 2, 3, 3, ...). (End)

			{1}; {1,1}; {2,2,1}; {2,5,3,1}; ...
Fourth row polynomial (n=3): p(3,x)= 2 + 5*x + 3*x^2 + x^3.

t[n_, m_] := Sum[Sum[Binomial[j, n-m-3*k+2*j]*(-1)^(j-k)*Binomial[k, j], {j, 0, k}]*Binomial[m+k, m], {k, 0, n-m}]; Table[t[n, m], {n, 0, 10}, {m, 0, n}] // Flatten (* Jean-François Alcover, May 27 2013, after Vladimir Kruchinin *)

T(n,m):=sum((sum(binomial(j,n-m-3*k+2*j)*(-1)^(j-k)*binomial(k,j),j,0,k)) *binomial(m+k,m),k,0,n-m); /* Vladimir Kruchinin, Dec 14 2011 */

a(n, m) := a(n-1, m) + (-(n-m+1)*a(n, m-1) + 3*(n+2*m)*a(n-1, m-1))/(8*m), n >= m >= 1; a(n, 0) := floor((n+2)/2) = A008619(n), n >= 0; a(n, m) := 0 if n < m.
G.f.for column m >= 0: ((x/((1-x^2)*(1-x)))^m)/((1-x^2)*(1-x)).
T(n,m) = Sum_{k=0..n-m} (Sum_{j=0..k} binomial(j, n-m-3*k+2*j)*(-1)^(j-k)*binomial(k,j))*binomial(m+k,m). - Vladimir Kruchinin, Dec 14 2011
Recurrence: T(n,k) = T(n-1,k) + T(n-1,k-1) + T(n-2,k) - T(n-3,k) with T(0,0) = 1. - Philippe Deléham, Feb 23 2012

A038165 G.f.: 1/((1-x)*(1-x^2))^5.

Original entry on oeis.org

1, 5, 20, 60, 160, 376, 820, 1660, 3190, 5830, 10252, 17380, 28600, 45760, 71500, 109252, 163735, 240955, 348920, 497640, 700128, 972400, 1334840, 1812200, 2435420, 3241628, 4276520, 5594360, 7261040, 9354080, 11966504, 15206840

Offset: 0

N. J. A. Sloane

nonn

Index entries for linear recurrences with constant coefficients, signature (5, -5, -15, 35, 1, -65, 45, 45, -65, 1, 35, -15, -5, 5, -1).

Cf. A008619, A006918, A038163.

CoefficientList[Series[1/((1-x)(1-x^2))^5,{x,0,35}],x]  (* Harvey P. Dale, Apr 02 2011 *)

a(2*k) = binomial(k + 7, 7)*(4*k^2 + 23*k + 18)/18 = A059601(k); a(2*k + 1) = binomial(k + 7, 7)*(4*k^2 + 41*k + 90)/18 = A059602(k), k >= 0.

A181477 a(n) has generating function 1/((1-x)^k(1-x^2)^(k(k-1)/2)) for k=5.

Original entry on oeis.org

1, 5, 25, 85, 275, 751, 1955, 4615, 10460, 22220, 45628, 89420, 170340, 313140, 562020, 980628, 1676370, 2800410, 4596290, 7399930, 11732006, 18297950, 28155910, 42716750, 64037980, 94823756, 138922300, 201325900, 288988100

Offset: 0

Wouter Meeussen, Oct 24 2010

a(n-1,k) is conjectured to also be the count of monomials (or terms) in the Schur polynomials of k variables and degree n, summed over all partitions of n in at most k parts (zero-padded to length k).

			a(3)=85 since the Schur polynomial of 5 variables and degree 4 starts off as x[1]*x[2]*x[3]*x[4] + x[1]*x[2]*x[3]*x[5] + ... + x[4]*x[5]^3 + x[5]^4. The exponents collect to the padded partitions of 4 as 5*p(1) + 40*p(2) + 30*p(3) + 150*p(4) + 50*p(5) where p(1) is the lexicographically first padded partition of 4: {4,0,0,0}, a coded form of monomials x[i]^4, and p(5) stands for {1,1,1,1}, coding x[i]x[j]x[k]x[l] with all indices different.

Alois P. Heinz, Table of n, a(n) for n = 0..1000
Wikipedia, Schur Polynomial

For k=2 (two variables): A002620, k=3: A038163, k=4: A054498 k=6: A181478, k=7: A181479, k=8: A181480.

Column k=5 of A210391. - Alois P. Heinz, Mar 22 2012

Tr[toz/@(Function[q,PadRight[q,k]]/@ (TransposePartition/@ Partitions[n,k]))/. w[arg__] -> 1 ]; with toz[p_]:=Block[{a,q,e,w}, u1=Expand[q Together[Expand[schur[p]]] +q a]/. Plus-> List ; u2=u1/. Times->w /. q->Sequence[]/. w[i_Integer, r__]-> i w[r] /. x[]^(e:1) ->e ; u3=Plus@@ u2/. w[arg__]:> Reverse@ Sort@ w[arg] /. w[a]->0 ]; and schur[p_]:=Block[{le=Length[p],n=Tr[p]}, Together[Expand[Factor[Det[Outer[ #2^#1&,p+le-Range[le] , Array[x,le]]]]/Factor[Det[Outer[ #2^#1&,Range[le-1,0,-1] , Array[x,le]]]] ]] ]

A038166 G.f.: 1/((1-x)*(1-x^2))^6.

Original entry on oeis.org

1, 6, 27, 92, 273, 714, 1715, 3816, 8007, 15938, 30381, 55692, 98735, 169806, 284349, 464672, 742950, 1164228, 1791426, 2710344, 4037670, 5928988, 8591154, 12294672, 17392258, 24337404, 33711510, 46251016, 62886162, 84779748

Offset: 0

N. J. A. Sloane

Index entries for linear recurrences with constant coefficients, signature (6, -9, -16, 60, -24, -116, 144, 66, -220, 66, 144, -116, -24, 60, -16, -9, 6, -1).

Cf. A008619, A006918, A038163-A038165.

A038166 := proc(n)
    add( A038163(n-i)*A038163(i),i=0..n) ;
end proc:
seq(A038166(n),n=0..30) ;# R. J. Mathar, Feb 22 2021

CoefficientList[Series[1/((1-x)(1-x^2))^6,{x,0,40}],x] (* or *) LinearRecurrence[ {6,-9,-16,60,-24,-116,144,66,-220,66,144,-116,-24,60,-16,-9,6,-1},{1,6,27,92,273,714,1715,3816,8007,15938,30381,55692,98735,169806,284349,464672,742950,1164228},40] (* Harvey P. Dale, Jun 10 2013 *)

a(2*k) = binomial(k + 8, 8)*(2*k + 9)*(8*k^2 + 72*k + 55)/(11*5*9) = A059603(k); a(2*k + 1) = 2*binomial(k + 9, 9)*(8*k^2 + 80*k + 165)/(11*5) = 2*A059624(k), k >= 0; Wolfdieter Lang, Feb 02 2000

a(0)=1, a(1)=6, a(2)=27, a(3)=92, a(4)=273, a(5)=714, a(6)=1715, a(7)=3816, a(8)=8007, a(9)=15938, a(10)=30381, a(11)=55692, a(12)=98735, a(13)=169806, a(14)=284349, a(15)=464672, a(16)=742950, a(17)=1164228, a(n)=6*a(n-1)-9*a(n-2)-16*a(n-3)+60*a(n-4)-24*a(n-5)-116*a(n-6)+144*a(n-7)+ 66*a(n-8)- 220*a(n-9)+66*a(n-10)+144*a(n-11)-116*a(n-12)-24*a(n-13)+60*a(n-14)-16*a(n-15)- 9*a(n-16)+ 6*a(n-17)-a(n-18). - Harvey P. Dale, Jun 10 2013

Showing 1-10 of 16 results. Next

cp's OEIS Frontend

A210391 Number A(n,k) of semistandard Young tableaux over all partitions of n with maximal element <= k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A001753 Expansion of 1/((1+x)*(1-x)^6).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A096338 a(n) = (2/(n-1))*a(n-1) + ((n+5)/(n-1))*a(n-2) with a(0)=0 and a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A005995 Alkane (or paraffin) numbers l(8,n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A060099 G.f.: 1/((1-x^2)^3*(1-x)^4).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

A164680 Expansion of x/((1-x)^3*(1-x^2)^3*(1-x^3)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A059594 Convolution triangle based on A008619 (positive integers repeated).

Views

Author

A096338 a(n) = (2/(n-1))a(n-1) + ((n+5)/(n-1))a(n-2) with a(0)=0 and a(1)=1.

A164680 Expansion of x/((1-x)^3(1-x^2)^3(1-x^3)).

A181477 a(n) has generating function 1/((1-x)^k(1-x^2)^(k(k-1)/2)) for k=5.