A000716 -id:A000716 - cp's OEIS frontend

A129126 Ninth diagonal of table A060850 counting partitions into parts of k kinds.

22, 185, 810, 2580, 6765, 15525, 32305, 62337, 113265, 195910, 325193, 521235, 810654, 1228080, 1817910, 2636326, 3753600, 5256711, 7252300, 9869990, 13266099, 17627775, 23177583, 30178575, 38939875, 49822812, 63247635

Offset: 1

Alford Arnold, Apr 03 2007

A slightly different method of calculating this sequence is described in A128627.

			From A128629 we can construct the table below:
      Deg    #  Associated sequence
  -------  ---  -------------------
        8    1    1  1   2   3    4
       44    2    3  1   3   6   10
       53   11    4  1   4   9   16
       62   11    4  1   4   9   16
       71   11    4  1   4   9   16
      332   12    6  1   6  18   40
      422   12    6  1   6  18   40
      431  111    8  1   8  27   64
      521  111    8  1   8  27   64
      611   12    6  1   6  18   40
     2222    4    7  1   5  15   35
     3221  112   12  1  12  54  160
     3311   22    9  1   9  36  100
     4211  112   12  1  12  54  160
     5111   13   10  1   8  30   80
    22211   23   15  1  12  60  200
    32111  113   20  1  16  90  320
    41111   14   14  1  10  45  140
   221111   24   21  1  15  90  350
   311111   15   22  1  12  63  224
  1111111    8   19  1   9  45  165
  2111111   16   26  1  14  84  336
  -------  ---   -- -- --- --- ----
              Sums: 22 185 810 2580 ...

Alois P. Heinz, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (9, -36, 84, -126, 126, -84, 36, -9, 1).

Cf. A000041, A000712, A000716, A023003, A060850, A128627, A128629.

with (numtheory): b:=proc(n) option remember; local d, j; `if` (n=0, 1, add (add (d, d=divisors(j)) *b(n-j), j=1..n)/n) end: A:= proc (n) option remember; local k; `if` (n=0, x, expand (add (b(k-1) *A(n-k) *x^(k-1), k=1..n))) end: a:= n-> coeftayl (A(n+8), x=0, 9): seq(a(n), n=1..40); # Alois P. Heinz, Oct 16 2008
# second Maple program:
a:= n-> n*(n+6)*(n+3)*(n+1)*(4200+(9994+(1571+(74+n)*n)*n)*n)/40320:
seq(a(n), n=1..40);  # Alois P. Heinz, Oct 17 2008

LinearRecurrence[{9, -36, 84, -126, 126, -84, 36, -9, 1}, {22, 185, 810, 2580, 6765, 15525, 32305, 62337, 113265}, 30] (* Jean-François Alcover, Mar 07 2021 *)

From Alois P. Heinz, Oct 17 2008: (Start)
G.f.: x*(x-2)*(2*x^5-14*x^4+35*x^3-32*x^2-x+11)/(x-1)^9.
a(n) = n*(n+6)*(n+3)*(n+1)*(4200+(9994+(1571+(74+n)*n)*n)*n)/40320. (End)

More terms from Alois P. Heinz, Oct 16 2008

A354648 G.f. A(x) satisfies: -x^3 = Sum_{n=-oo..oo} (-1)^n * x^(n(n+1)/2) A(x)^(n*(n-1)/2).

Original entry on oeis.org

1, 0, 0, 1, 3, 9, 22, 54, 135, 368, 1060, 3135, 9295, 27472, 81309, 242255, 728429, 2208483, 6736523, 20634196, 63410076, 195467757, 604457802, 1875053982, 5833449236, 18195767301, 56888745654, 178238369769, 559538565187, 1759796017533, 5544359742297

Offset: 0

Paul D. Hanna, Jun 21 2022

nonn

			G.f.: A(x) = 1 + x^3 + 3*x^4 + 9*x^5 + 22*x^6 + 54*x^7 + 135*x^8 + 368*x^9 + 1060*x^10 + 3135*x^11 + 9295*x^12 + 27472*x^13 + ...
such that A = A(x) satisfies:
(1) -x^3 = ... + x^36*A^28 - x^28*A^21 + x^21*A^15 - x^15*A^10 + x^10*A^6 - x^6*A^3 + x^3*A - x + 1 - A + x*A^3 - x^3*A^6 + x^6*A^10 - x^10*A^15 + x^15*A^21 - x^21*A^28 + x^28*A^36 + ...
(2) -x^3 = (1-x) - (1-x^3)*A + x*(1-x^5)*A^3 - x^3*(1-x^7)*A^6 + x^6*(1-x^9)*A^10 - x^10*(1-x^11)*A^15 + x^15*(1-x^13)*A^21 - x^21*(1-x^15)*A^28 + ...
(3) -x^3 = (1-A) - (1-A^3)*x + A*(1-A^5)*x^3 - A^3*(1-A^7)*x^6 + A^6*(1-A^9)*x^10 - A^10*(1-A^11)*x^15 + A^15*(1-A^13)*x^21 - A^21*(1-A^15)*x^28 + ...
(4) -x^3 = (1 - x*A)*(1 - A)*(1-x) * (1 - x^2*A^2)*(1 - x*A^2)*(1 - x^2*A) * (1 - x^3*A^3)*(1 - x^2*A^3)*(1 - x^3*A^2) * (1 - x^4*A^4)*(1 - x^3*A^4)*(1 - x^4*A^3) * (1 - x^5*A^5)*(1 - x^4*A^5)*(1 - x^5*A^4) * ...

Cf. A268650, A354647, A354649, A000716.

{a(n) = my(A=[1]); for(i=1,n, A = concat(A,0);
A[#A] = polcoeff(x^3 + sum(m=0,sqrtint(2*#A+9), (-1)^m * x^(m*(m-1)/2) * (1 - x^(2*m+1)) * Ser(A)^(m*(m+1)/2) ),#A-1) );A[n+1]}
for(n=0,30,print1(a(n),", "))

G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies:
(1) -x^3 = Sum_{n=-oo..oo} (-1)^n * x^(n*(n-1)/2) * A(x)^(n*(n+1)/2).
(2) -x^3 = Sum_{n>=0} (-1)^n * x^(n*(n-1)/2) * (1 - x^(2*n+1)) * A(x)^(n*(n+1)/2).
(3) -x^3 = Sum_{n>=0} (-1)^n * A(x)^(n*(n-1)/2) * (1 - A(x)^(2*n+1)) * x^(n*(n+1)/2).
(4) -x^3 = Product_{n>=1} (1 - x^n*A(x)^n) * (1 - x^(n-1)*A(x)^n) * (1 - x^n*A(x)^(n-1)), by the Jacobi triple product identity.

A382521 Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where n unlabeled objects are distributed into k containers of three kinds. Containers may be left empty.

Original entry on oeis.org

1, 3, 0, 6, 3, 0, 10, 9, 3, 0, 15, 18, 15, 3, 0, 21, 30, 36, 18, 3, 0, 28, 45, 66, 55, 24, 3, 0, 36, 63, 105, 114, 81, 27, 3, 0, 45, 84, 153, 195, 189, 108, 33, 3, 0, 55, 108, 210, 298, 348, 276, 145, 36, 3, 0, 66, 135, 276, 423, 558, 552, 405, 180, 42, 3, 0, 78, 165, 351, 570, 819, 936, 858, 549, 225, 45, 3, 0

Offset: 0

Peter Dolland, Mar 30 2025

			Array starts:
 0 : [1, 3,  6,  10,   15,   21,   28,    36,    45,    55,    66]
 1 : [0, 3,  9,  18,   30,   45,   63,    84,   108,   135,   165]
 2 : [0, 3, 15,  36,   66,  105,  153,   210,   276,   351,   435]
 3 : [0, 3, 18,  55,  114,  195,  298,   423,   570,   739,   930]
 4 : [0, 3, 24,  81,  189,  348,  558,   819,  1131,  1494,  1908]
 5 : [0, 3, 27, 108,  276,  552,  936,  1428,  2028,  2736,  3552]
 6 : [0, 3, 33, 145,  405,  858, 1532,  2427,  3543,  4880,  6438]
 7 : [0, 3, 36, 180,  549, 1248, 2340,  3861,  5811,  8190, 10998]
 8 : [0, 3, 42, 225,  741, 1785, 3510,  6000,  9300, 13410, 18330]
 9 : [0, 3, 45, 271,  957, 2451, 5051,  8967, 14307, 21126, 29424]
10 : [0, 3, 51, 324, 1227, 3312, 7137, 13125, 21552, 32553, 46194]
...

Antidiagonal sums give A000716.
Alternating antidiagonal sums give A107635.
Without empty containers: A382025.
Cf. A382343, A000217, 2 kinds: A382345.

b:= proc(n, i) option remember; expand(`if`(n=0, 1, `if`(i<1, 0,
      add(x^j*b(n-i*j, min(n-i*j, i-1))*(j+2)*(j+1)/2, j=0..n/i))))
    end:
A:= (n, k)-> coeff(b(n+k$2), x, k):
seq(seq(A(n, d-n), n=0..d), d=0..11);  # Alois P. Heinz, Mar 31 2025

from sympy import binomial
from sympy.utilities.iterables import partitions
def a_row(n, length=11) :
    if n == 0 : return [ binomial( k + 2, 2) for k in range( length) ]
    t = list( [0] * length)
    for p in partitions( n):
        fact = 1
        s = 0
        for k in p :
            s += p[k]
            fact *= binomial( 2 + p[k], 2)
        if s > 0 :
            t[s] += fact
    a = list( [0] * length)
    for i in range( 1, length):
        for j in range( i, 0, -1):
            a[i] += t[j] * binomial( i - j + 2, 2)
    return a
for n in range(11): print(a_row(n))

A(0,k) = binomial(k + 2, 2) = A000217(k + 1).
A(1,k) = 3 * binomial(k + 1, 2).
A(n,1) = 3.
A(n,k) = Sum_{i=0..k} binomial(k + 2 - i, 2) * A382343(n,i) for k <= n.
A(n,k) = A382343(n+k,k).

A277992 b(n, 2) where b(n, m) is defined by expansion of ((Product_{k>=1} (1 - x^(prime(n)*k))/(1 - x^k)^prime(n)) - 1)/prime(n) in powers of x.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 10, 11, 13, 16, 17, 20, 22, 23, 25, 28, 31, 32, 35, 37, 38, 41, 43, 46, 50, 52, 53, 55, 56, 58, 65, 67, 70, 71, 76, 77, 80, 83, 85, 88, 91, 92, 97, 98, 100, 101, 107, 113, 115, 116, 118, 121, 122, 127, 130, 133, 136, 137, 140, 142, 143, 148, 155, 157

Offset: 1

Seiichi Manyama, Nov 07 2016

nonn

c(n, m) is defined by expansion of (Product_{k>=1} 1/(1 - x^k)^prime(n))/prime(n) in powers of x.

b(n, 2) = c(n, 2) for n > 1.

			a(1) = b(1, 2) = A014968(2) = 2.
a(2) = b(2, 2) = A277968(2) = c(2, 2) = A000716(2)/3 = 3.
a(3) = b(3, 2) = A277974(2) = c(3, 2) = A023004(2)/5 = 4.
a(4) = b(4, 2) = A160549(2) = c(4, 2) = A023006(2)/7 = 5.
a(5) = b(5, 2) = A277912(2) = c(5, 2) = A023010(2)/11 = 7.

Cf. A014968, A277968, A277974, A160549, A277912.

Expansion of Product_{k>=1} 1/(1 - x^k)^prime(n): A000712 (n=1), A000716 (n=2), A023004 (n=3), A023006 (n=4), A023010 (n=5).

a(n) = A098090(n - 1) = (prime(n) + 3)/2 for n > 1.

A347187 Triangle read by rows T(n,k), (n,k>=0), with row/diagonal sums to overpartitions/partitions isomorphic to binomial coefficient sums to 2^n/F(n) (Fibonacci numbers) on Pascal's triangle.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 3, 6, 3, 1, 1, 3, 8, 8, 3, 1, 1, 3, 9, 14, 9, 3, 1, 1, 3, 9, 19, 19, 9, 3, 1, 1, 3, 9, 21, 32, 21, 9, 3, 1, 1, 3, 9, 22, 42, 42, 22, 9, 3, 1, 1, 3, 9, 22, 48, 66, 48, 22, 9, 3, 1, 1, 3, 9, 22, 50, 87, 87, 50, 22, 9, 3, 1

Offset: 0

Richard Joseph Boland, Aug 21 2021

The rows sum to overpartitions (A015128). All T(n,k) intersected by the diagonal line drawn on points {T(n,0), T(n-1,1)} sum to unrestricted partitions of n (A000041). The same lines drawn on Pascal's triangle produce the well-known sums to 2^n and to the Fibonacci numbers, resp.
The central T(2n,n) are A035592.
The triangle is found via a generalization of Euler's pentagonal number theorem over 2 positive integer parameters alpha and beta (a,b here) *[1]. Substituting the quadratic f(a,b,k)=((a+b)k^2-(b-a)k)/2 in place of f(k)=(3k^2-k)/2 (the quadratic of the generalized pentagonal numbers (A001318)) produces partition functions, p(a,b,n), and sigma sum of divisors functions, s(a,b,n), restricted to counting/summing only partitions/divisors with parts equivalent to 0, a or b mod (a+b). Only integers 0 < a < b are considered, to avoid duplicates. The base case is given when a=1, b=2, with corresponding Euler recurrences for unrestricted partitions and sum of divisors (A000203) functions. All other b > a cases produce the mod-restricted analogs. The coefficients of the a,b-generalized recurrences, analogous to A010815, are given by directly inverting the sequence of the mod-restricted partitions, i.e., inverting the a,b-partition generating function. The a=b cases are considered separately because the a=b=1 case yields the overpartitions function and a naturally defined "overdivisors" function.
Let the sequences of P(i+1,i+2,j) over j >= 0 be the i-th rows over i >= 0 to produce this table:
  1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, ...
  1, 0, 1, 1, 1, 2,  2,  3,  4,  4,  7,  6, 10,  11,  13,  18,  19, ...
  1, 0, 0, 1, 1, 0,  1,  2,  1,  1,  3,  3,  2,   3,   6,   4,   4, ...
  1, 0, 0, 0, 1, 1,  0,  0,  1,  2,  1,  0,  1,   3,   3,   1,   1, ...
  1, 0, 0, 0, 0, 1,  1,  0,  0,  0,  1,  2,  1,   0,   0,   1,   3, ...
  1, 0, 0, 0, 0, 0,  1,  1,  0,  0,  0,  0,  1,   2,   1,   0,   0, ...
  1, 0, 0, 0, 0, 0,  0,  1,  1,  0,  0,  0,  0,   0,   1,   2,   1, ...
  1, 0, 0, 0, 0, 0,  0,  0,  1,  1,  0,  0,  0,   0,   0,   0,   1, ...
  1, 0, 0, 0, 0, 0,  0,  0,  0,  1,  1,  0,  0,   0,   0,   0,   0, ...
  1, 0, 0, 0, 0, 0,  0,  0,  0,  0,  1,  1,  0,   0,   0,   0,   0, ...
  1, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0,  1,  1,   0,   0,   0,   0, ...
The finite sequences of the T(n,k) rows appear in order on every row of the table, with i zeros between each T(n,0). As j increases, n eventually exceeds i on a given table row and the triangle rows then overlap and sum. Sequence A000041, as the first table row, for example, is constructed by padding every row of the triangle with n zeros and summing them into a single sequence. Using T(n,k) = p(n+1, n+2, 2*binomial(n+1,2)+k) ensures i is sufficiently large to avoid overlaps.
A recursive method of generating the triangle is found by first observing that since the rows sum to overpartitions (let this be O_p(n)), the recursion for O_p(n) may be used, but must operate on whole rows rather than singular values, so must also specify a correct offset for the starting point of each row when added in the recursive sum. Since overpartitions are given when a=b=1, the recurrence for O_p(n) can be derived by substituting into the a,b-generalized Euler recurrence for p(a,b,n), given by p(a,b,n) = p(a,b,n-f(a,b,1)) + p(a,b,n-f(a,b,-1)) - p(a,b,n-f(a,b,2)) - p(a,b,n-f(a,b,-2)) ..., to produce p(1,1,n) = O_p(n) = 2*O_p(n-1) - 2*O_p(n-4) + 2*O_p(n-9) - ... = Sum_{j=1..floor(sqrt(n))} (-1)^(j+1)*2*O_p(n-j^2). The coefficients of this recurrence may also be derived by direct examination of the inverse of the sequence of overpartitions, i.e., the coefficients of the q-series with g.f. Product_{k>=1} (1-q^k)/(1+q^k) *[2][3]. It follows by induction that each 2*O_p(n-j^2) term is composed of 2 copies of a previous row, with different offsets given by binomial(j,2) and binomial(j+1,2). Thus, with O_p(0)=T(0,0)=1 by definition, we obtain: T(n,k) = Sum_{j=1..floor(sqrt(n))} (-1)^(j+1)*(T(n-j^2, k - binomial(j,2)) + T(n-j^2, k - binomial(j+1,2))).
Analogous to the row/diagonal sums, all a,b-generalized partition values, p(a, b, n), may be computed by summing the T(n,k) given on the integral points of the line y = ((a-b)*x + n)/a, where the left edge of the triangle is taken as the y-axis, +y is in the down direction and (y,x) are proxies for (n,k). The generalization's duplicate values, given by the b > a cases, correspond to lines with positive slope, giving the p(b, a, n) as sums of the T(n,k) on integral points on the lines y = ((b-a)*x + n)/b. The lines of the duplicates are the reflections about the triangle's T(2n,n) symmetry axis. Were the symmetry axis to be taken as the y-axis, the slopes of mutually reflected lines would have the same magnitudes with opposite signs. With the Cartesian approach here, the T(n,k) summing to p(a,b,n) appear on lines with rational, negative slopes on the open interval m = (-oo, 0), with unrestricted partitions given on m = -1 lines. Overpartitions are given on m=0 and the T(n,k) summing to the duplicates, p(b,a,n), then appear on positively sloped lines over the open interval m = (0,1), with unrestricted partitions given again on lines with m = 1/2.
The lines containing the T(n,k) summing to p(a,b,n), when mapped to Pascal's triangle, correspond to a,b-generalized Fibonacci numbers, given by F(a, b, 0) = 1, F(a, b, n) = F(a, b, n-a) + F(a, b, n-b). Swapping a and b then produces the reflected duplicates, F(b, a, n), in the same manner that the p(b, a, n) duplicate values are produced.
For fixed k, T(n, k) = T(n, n-k) increase with n to maximum "eventual" values, given by A000716.
[1] H. Leung demonstrates the generalization for the a=1 cases, with applications to Bell Polynomials (see ref.).
[2] R. da Silva and P. Sakai provide another proof of the overpartitions recurrence in their paper (see ref.).
[3] Merca derives the overpartitions recurrence directly from an identity attributed to Gauss (see ref.).

			Triangle begins:
  1;
  1,  1;
  1,  2,  1;
  1,  3,  3,  1;
  1,  3,  6,  3,  1;
  1,  3,  8,  8,  3,  1;
  1,  3,  9, 14,  9,  3,  1;
  1,  3,  9, 19, 19,  9,  3,  1;
  1,  3,  9, 21, 32, 21,  9,  3,  1;
  1,  3,  9, 22, 42, 42, 22,  9,  3,  1;
  1,  3,  9, 22, 48, 66, 48, 22,  9,  3,  1;
  1,  3,  9, 22, 50, 87, 87, 50, 22,  9,  3,  1;

Richard Joseph Boland, Quadratic Polynomial Number Theorem Part 7 - Overpartitions, Moreoverpartitions and More.
R. da Silva and P. Sakai, New partition function recurrences, J. of Int. Seq. 23 (2020), Article 20.11.8, 16 pp.
H. Leung, On a generalization of the pentagonal number theorem, Kyungpook Math. J. 58 (2018), 599-613.
Mircea Mirca, Overpartitions and functions from multiplicative number theory, UPB Scientific Bulletin, Series A: Applied Mathematics and Physics. 83. 97-106.

Cf. A015128 (row sums), A007318, A000079, A000041 (diagonal sums), A000045, A001318, A000203, A010815, A000716.

(* via a,b mod restricted partition functions *)
lim = 20; P[a_,b_,n_] := P[a,b,n] = (F[k_] := ((a+b)k^2 + (a-b)k)/2;
P[a, b, 0] = 1; If[n == 0, 1, Sum[(-1)^(k+1)
  (If[n-F[k] < 0, 0, P[a,b,n-F[k]]] +
   If[n-F[-k] < 0, 0, P[a,b,n-F[-k]]]), {k,1,n}]]);
T[n_,k_] := T[n,k] =
(If[k < 0 || k > n, 0, P[n+1, n+2, 2 Binomial[n+1, 2]+k]]);
MatrixForm[Table[Table[T[n, k], {k,0,n}], {n,0,lim}]]
(* via direct recursion *)
lim = 20;
T[n_,k_]:=T[n,k]=(T[0,0]=1;
If[n==0 && k==0, 1, Sum[(-1)^(j+1)(If[k-Binomial[j, 2] < 0, 0, T[n-j^2, k-Binomial[j, 2]]] + If[k-Binomial[j+1, 2] < 0, 0, T[n-j^2, k-Binomial[j+1, 2]]]), {j, 1, Floor[n^(1/2)]}]]);
MatrixForm[Table[Table[T[n,k],{k,0,n}],{n,0,lim}]]
(* via a recursion operating on the triangle row sequences *)
lim=20;S[0]={1};
Table[S[n]=Sum[(-1)^(j+1)(PadRight[PadLeft[S[n-j^2],n+1-Binomial[j,2]],n+1] + PadRight[PadLeft[S[n-j^2],n+1-Binomial[j+1,2]],n+1]),{j,1,Floor[n^(1/2)]}],{n,1,lim}];
MatrixForm[Table[S[n],{n,0,lim}]]
(* p(a,b,n) (and p(b,a,n)) via summing select T(n,k) from the triangle held in memory. *)
memlim = 300;
S[0] = {1}; Table[
S[n] = Sum[(-1)^(j + 1) (PadRight[
       PadLeft[S[n - j^2], n + 1 - Binomial[j, 2]], n + 1] +
      PadRight[PadLeft[S[n - j^2], n + 1 - Binomial[j + 1, 2]],
       n + 1]), {j, 1, Floor[n^(1/2)]}], {n, 1, memlim}];
y[a_, b_, x_, n_] := -((b - a)/a) x + n/a;
p[a_, b_, n_] := (x = 0; P = 0;
  If[n == 0, P = 1,
   While[x <= y[a, b, x, n],
    If[y[a, b, x, n] == Floor[y[a, b, x, n]],
     P += If[x > y[a, b, x, n], 0, S[y[a, b, x, n]][[x + 1]]]];
    x += 1]]; P)

T(n,k) = if (!n && !k, 1, sum(j=1, sqrtint(n), (-1)^(j+1)*(T(n-j^2, k - binomial(j,2)) + T(n-j^2, k - binomial(j+1,2))))); \\ Michel Marcus, Aug 26 2021

Via a,b mod restricted partition function:
T(n,k) = p(n+1, n+2, 2*binomial(n+1,2)+k), where
p(a,b,n) is the n-th coefficient of the q-series with g.f. Product_{k>=1|k==0,k==a or k==b (mod (a+b))} 1/(1-q^k), or
p(a,b,n) can be computed using its Euler recurrence given by:
p(a,b,n) = Sum_{k>=1|n-f(a,b,k)>=0} (-1)^(k+1)*(p(a,b,n-f(a,b,k)) + p(a,b,n-f(a,b,-k))), where, if n-f(a,b,-k)<0, p(a,b,n-f(a,b,-k))=0 and
f(a,b,k) = ((a+b)*k^2-(b-a)*k)/2.
Via direct recursion:
T(0,0) = 1;
T(n,k) = Sum_{j=1..floor(sqrt(n))} (-1)^(j+1)*(T(n-j^2, k - binomial(j,2)) + T(n-j^2, k - binomial(j+1,2))).
p(a,b,n) (also p(b,a,n)) via sums of T(n,k) on integral lattice points of y(x) = -((b-a)/a)*x + n/a:
p(a, b, n) = Sum_{   x| 0 <= x <= y(x),
                  y(x)| y(x) = floor(y(x)) } T(y(x), x).

cp's OEIS Frontend

A129126 Ninth diagonal of table A060850 counting partitions into parts of k kinds.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A354648 G.f. A(x) satisfies: -x^3 = Sum_{n=-oo..oo} (-1)^n * x^(n*(n+1)/2) * A(x)^(n*(n-1)/2).

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

Formula

A382521 Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where n unlabeled objects are distributed into k containers of three kinds. Containers may be left empty.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Python

Formula

A277992 b(n, 2) where b(n, m) is defined by expansion of ((Product_{k>=1} (1 - x^(prime(n)*k))/(1 - x^k)^prime(n)) - 1)/prime(n) in powers of x.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A347187 Triangle read by rows T(n,k), (n,k>=0), with row/diagonal sums to overpartitions/partitions isomorphic to binomial coefficient sums to 2^n/F(n) (Fibonacci numbers) on Pascal's triangle.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A354648 G.f. A(x) satisfies: -x^3 = Sum_{n=-oo..oo} (-1)^n * x^(n(n+1)/2) A(x)^(n*(n-1)/2).