Sequences

a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+3), with T given by A026323.

a(n) = Sum_{k=0..n+2} (k+1) * A026323(n, k).

a(n) = Sum_{k=0..2n} (k+1) * A026323(n, 2n-k).

a(n) is the sum of squares of numbers in row n of array T given by A026323.

Self-convolution of array T given by A026082.

a(n) = Sum_{k=0..m-1} T(n,k) * T(n,k+1), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.

a(n) = Sum_{k=0..m-2} T(n,k) * T(n,k+2), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.

a(n) = Sum_{k=0..m-3} T(n,k) * T(n,k+2), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.

a(n) = Sum_{k=0..m} (k+1) * A026082(n, k), where 0 <= k <= m, m=n for n=0,1,2,3; m=2n for n >= 4.

Duplicate of A027319.

Duplicate of A027315.

Self-convolution of row n of array T given by A026120.

a(n) = Sum_{k=0..m} T(n,k) * T(n,k+1), where m=0 for n=1; m=n for n >= 2; and T is given by A026120.

a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+2), with T given by A026120.

a(n) = Sum_{k=0..n-2} T(n,k) * T(n,k+3), with T given by A026120.

a(n) = Sum_{k=0..m} (k+1) * A026120(n, k), where m=0 for n=0,1; m=n for n >= 2.

a(n) = Sum_{k=0..m} (k+1) * A026120(n, m-k), where m=0 for n=0,1; m=n for n >= 2.

a(n) is the sum of squares of the numbers in row n of array T given by A026120.

a(n) = self-convolution of row n of array T given by A026148.

a(n) = Sum_{k=0..m} T(n,k) * T(n,k+1), where m=0 for n=1; m=n+1 for n >= 2; and T is given by A026148.

a(n) = Sum_{k=0..m} T(n,k) * T(n,k+2), where m=2 for n=2 and m=n+1 for n >= 3; and T is given by A026148.

a(n) = Sum_{k=0..n-1} T(n,k) * T(n,k+3), with T given by A026148.

a(n) = Sum_{k=0..m} (k+1) * A026148(n, k), where m=0 for n=1; m=n+1 for n >= 2.

a(n) = Sum_{k=0..m} (k+1) * A026148(n, m-k), where m=0 for n=1; m=n+1 for n >= 2.

a(n) is the sum of squares of the numbers in row n of array T given by A026148.

Number of partitions of n that do not contain 2 as a part.

Number of partitions of n that do not contain 3 as a part.

Number of partitions of n that do not contain 4 as a part.

Number of partitions of n that do not contain 5 as a part.

Number of partitions of n that do not contain 6 as a part.

Number of partitions of n that do not contain 7 as a part.

Number of partitions of n that do not contain 8 as a part.

Number of partitions of n that do not contain 9 as a part.

Number of partitions of n that do not contain 10 as a part.

Triangular array T given by rows: T(n,k) = number of partitions of n into distinct odd parts, the least being k.

Expansion of Product_{m>=1} (1 + q^m)^(3*m).

Number of partitions of n into distinct odd parts, the least being congruent to 1 mod 4.

Number of partitions of n into distinct odd parts, the least being congruent to 3 mod 4.

Number of partitions of n into distinct odd parts, the least being 1.

Number of partitions of n into distinct odd parts, the least being 3.

Number of partitions of n into distinct odd parts, the least being 5.

Number of partitions of n into distinct odd parts, the least being 7.

Number of partitions of n into distinct odd parts, the least being 9.

Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, the least being <= k.

Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, all >= k.

Array read by rows: T(n,k) = number of partitions of n into distinct odd parts in which k is the greatest part, for k=1,2,...,n, n>=1.

Number of partitions of n into distinct odd parts, the greatest being congruent to 1 mod 4.

Number of partitions of n into distinct odd parts, the greatest being congruent to 3 mod 4.

Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, all <= k.

Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, the greatest being >= k.