Sequences

a(n) = A026907(2*n, n-2).

T(2n-1,n-1), T given by A026907.

T(2n-1,n-2), T given by A026907.

T(n,[ n/2 ]), T given by A026907.

a(n) = T(n,0) + T(n,1) + ... + T(n,n), T given by A026907.

a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026907.

a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026907.

Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026907.

Uniquification of A026907.

Triangular array O by rows: O(n,k) = number of partitions of n into an odd number of parts, the greatest being k.

Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the greatest being k.

Number of partitions of n into an odd number of parts, the greatest being 2; also, a(n+3) = number of partitions of n+1 into an even number of parts, each <=2.

Number of partitions of n into an odd number of parts, the greatest being 3; also, a(n+5) = number of partitions of n+2 into an even number of parts, each <= 3.

Number of partitions of n into an odd number of parts, the greatest being 4; also, a(n+7) = number of partitions of n+3 into an even number of parts, each <=4.

Number of partitions of n into an odd number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an even number of parts, each <=5.

Number of partitions of n into an odd number of parts, the greatest being 6; also, a(n+11) = number of partitions of n+5 into an even number of parts, each <=6.

Number of partitions of n into an even number of parts, the greatest being 3; also, a(n+5) = number of partitions of n+2 into an odd number of parts, each <= 3.

Number of partitions of n into an even number of parts, the greatest being 4; also, a(n+7) = number of partitions of n+3 into an odd number of parts, each <=4.

Number of partitions of n into an even number of parts, the greatest being 5; also, a(n+9) = number of partitions of n+4 into an odd number of parts, each <=5.

Number of partitions of n into an even number of parts, the greatest being 6; also, a(n+11) = number of partitions of n+5 into an odd number of parts, each <=6.

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

Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k.

Self-convolution of array T given by A008288.

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

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

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

a(n) = Sum_{k=0..n} (k+1)*T(n, n-k), where T is given by A008288.

Greatest number in row of n array T given by A026300.

Self-convolution of array T given by A026300.

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

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

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

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

E.g.f. is inverse function to y -> integral from 0 to y of exp(-s^2).

A bisection of the Motzkin numbers A001006.

Self-convolution of array T given by A026374.

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

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

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

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

Self-convolution of array T given by A026386.

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

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

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

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

Self-convolution of array T given by A026615.

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

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

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

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