cp's OEIS Frontend

Define a unit column of a binary matrix to be a column with only one 1. a(n) = number of 3 X n binary matrices with 1 unit column up to row and column permutations (if offset is 1). - Vladeta Jovovic, Sep 09 2000

Generally, number of 3 X n binary matrices with k=0,1,2,... unit columns, up to row and column permutations, is the coefficient of x^k in 1/6*(Z(S_n; 5 + 3*x,5 + 3*x^2, ...) + 3*Z(S_n; 3 + x,5 + 3*x^2,3 + x^3,5 + 3*x^4, ...) + 2*Z(S_n; 2,2,5 + 3*x^3,2,2,5 + 3*x^6, ...)), where Z(S_n; x_1,x_2,...,x_n) is the cycle index of symmetric group S_n of degree n.

First differences of a(n) give number of minimal 3-covers of an unlabeled n-set that cover 4 points of that set uniquely (if offset is 4).

Transform of tetrahedral numbers, binomial(n+3,3), under the Riordan array (1/(1-x^2), x). - Paul Barry, Apr 16 2005

Equals triangle A152205 as an infinite lower triangular matrix * [1, 2, 3, ...]. - Gary W. Adamson, Feb 14 2010

With a leading zero, number of all possible octahedra of any size, formed when intersecting a regular tetrahedron by planes parallel to its sides and dividing its edges into n equal parts. - V.J. Pohjola, Sep 13 2012

With 2 leading zeros and offset 1, the sequence becomes 0,0,1,4,11,... for n=1,2,3,... Call this b(n). Consider the partitions of n into two parts (p,q) with p <= q. Then b(n) is the total volume of the family of rectangular prisms with dimensions p, |q - p| and |q - p|. - Wesley Ivan Hurt, Apr 14 2018

Conjecture: For n > 2, a(n-3) is the absolute value of the coefficient of the term [x^(n-2)] in the characteristic polynomial of an n X n square matrix M(n) defined as the n-th principal submatrix of the array A010751 whose general element is given by M[i,j] = floor((j - i + 1)/2). - Stefano Spezia, Jan 12 2022

Consider the following drawing of the complete graph on n vertices K_n: Vertices 1, 2, ..., n are on a straight line. Any pair of nonconsecutive vertices (i, j) with i < j is connected by a semicircle that goes above the line if i is odd, and below if i is even. With four leading zeros and offset 1, a(n) gives the number of edge crossings of the aforementioned drawing of K_n. - Carlo Francisco E. Adajar, Mar 17 2022

Number of triangles in triangular matchstick arrangement of side n, for n >= 1. Row sums of A085691.

We observe that the sequence is the transform of A006578 by the following transform T: T(u_0,u_1,u_2,u_3,...)=(u_0,u_0+u_1, u_0+u_1+u_2, u_0+u_1+u_2+u_3+u_4,...). In another terms v_p=sum(u_k,k=0..p) and the G.f phi_v of v is given by: phi_v=phi_u/(1-z). - Richard Choulet, Jan 28 2010

Row sums of A220053, for n > 0. - Reinhard Zumkeller, Dec 03 2012

a(n) has the expansion (1*0)+(1*1)+(4*1)+(4*2)+(7*2)+(7*3)+..., where the expansion stops when a(n) has n+1 number of terms. The expansion starts at (1*0), and progresses by alternating addition of 1 to the second number and 3 to the first number. - Arlu Genesis A. Padilla, Jun 04 2014

Taking the absolute values of each n-th difference and excluding the first n terms of each mentioned sequence, A002717 has the first difference A006578 (see formula of Michael Somos dated Jun 09 2014), the second difference A032766 (see 'partial sum' crossref), the third difference A000034, the fourth difference A000012, and the fifth to n-th difference A000004. - Arlu Genesis A. Padilla, Jun 12 2014

Also, row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color; the color classes are not interchangeable.

Also the number of principal transversal matroids (also known as fundamental transversal matroids) of size n and rank k (originally enumerated by Brylawski). - Gordon F. Royle, Oct 30 2007

This sequence is also obtained if we read the array A(m,n) = number of inequivalent m X n binary matrices by antidiagonals, where equivalence means permutations of rows or columns (m>=0, n>=0) [Kerber]. - N. J. A. Sloane, Sep 01 2013

Number of ZnS molecules in cluster of n layers in zinc blende crystal.

(Zinc sulfide crystallizes in two different forms: wurtzite and zinc blende, the latter is also spelled zincblende.) - Jonathan Vos Post, Jan 22 2013

The Kn4 triangle sums of the Connell-Pol triangle A159797 lead to the sequence given above. For the definitions of the Kn4 and other triangle sums see A180662. - Johannes W. Meijer, May 20 2011

If one generated primitive Pythagorean triangles (2n+1, 2n+3) the collective sum of their perimeters for each n is four times the numbers listed in this sequence. - J. M. Bergot, Jul 18 2011

a(n) is the number of 3-tuples (w,x,y) having all terms in {0,...,n} and nA000292(n)+A000292(n+1)=n^3. - Clark Kimberling, Jun 04 2012

Degrees of the Hilbert polynomials for B_3 and C_3, per p. 13 of Gashi et al. - Jonathan Vos Post, Dec 14 2013

Number of solutions to a + b = c + d when 0 < a <= k, 0 <= b, c, d <= k, k = 0, 1, 2, 3.... Taken from Step 1 2007 problem #1(i) using 4 digit balanced numbers. - Bobby Milazzo, Mar 09 2013

From J. M. Bergot, Jun 18 2013: (Start)

Consider the lower half, including the main diagonal, of the array in A144216 as a triangle. The rows begin:

0;

1, 2;

3, 4, 6;

6, 7, 9, 12, ...

The sum of the terms in row(n) is a(n). (End)

This sequence is related to A008865 by a(n) = n*A008865(n+1) - Sum_{i=1..n} A008865(i) for n>0. - Bruno Berselli, Aug 06 2015

For n >= i, i = 6,7, a(n - i) is the number of incongruent two-color bracelets of n beads, i of which are black (cf. A005513, A032280), having a diameter of symmetry. The latter means the following: if we imagine (0,1)-beads as points (with the corresponding labels) dividing a circumference of a bracelet into n identical parts, then a diameter of symmetry is a diameter (connecting two beads or not) such that a 180-degree turn of one of two sets of points around it (obtained by splitting the circumference by this diameter) leads to the coincidence of the two sets (including their labels). - Vladimir Shevelev, May 03 2011

From Johannes W. Meijer, May 20 2011: (Start)

The Kn11, Kn12, Kn13, Fi1 and Ze1 triangle sums, see A180662 for their definitions, of the Connell-Pol triangle A159797 are linear sums of shifted versions of the duplicated tetrahedral numbers, e.g., Fi1(n) = a(n-1) + 5*a(n-2) + a(n-3) + 5*a(n-4).

The Kn11, Kn12, Kn13, Kn21, Kn22, Kn23, Fi1, Fi2, Ze1 and Ze2 triangle sums of the Connell sequence A001614 as a triangle are also linear sums of shifted versions of the sequence given above. (End)

The number of quadruples of integers [x, u, v, w] that satisfy x > u > v > w >= 0, n + 5 = x + u. - Michael Somos, Feb 09 2015

Also, this sequence is the fourth column in the triangle of the coefficients of the sum of two consecutive Fibonacci polynomials F(n+1, x) and F(n, x) (n>=0) in ascending powers of x. - Mohammad K. Azarian, Jul 18 2018

Coefficients of the (left, normalized) shifted cyclotomic polynomial. Or, coefficients of the basic n-th q-series for q=-2. Indeed, let Y_n(x) = Sum_{k=0..n} x^k, having as roots all the n-th roots of unity except for 0; then coefficients in x of (-1)^n Y_n(-x-1) give exactly the n-th row of A059260 and a practical way to compute it. - Olivier Gérard, Jul 30 2002

The maximum in the (2n)-th row is T(n,n), which is A026641; also T(n,n) ~ (2/3)*binomial(2n,n). The maximum in the (2n-1)-th row is T(n-1,n), which is A014300 (but T does not have the same definition as in A026637); also T(n-1,n) ~ (1/3)*binomial(2n,n). Here is a generalization of the formula given in A026641: T(i,j) = Sum_{k=0..j} binomial(i+k-x,j-k)*binomial(j-k+x,k) for all x real (the proof is easy by induction on i+j using T(i,j) = T(i-1,j) + T(i,j-1)). - Claude Morin, May 21 2002

The second greatest term in the (2n)-th row is T(n-1,n+1), which is A014301; the second greatest term in the (2n+1)-th row is T(n+1,n) = 2*T(n-1,n+1), which is 2*A014301. - Claude Morin

Diagonal sums give A008346. - Paul Barry, Sep 23 2004

Riordan array (1/(1-x^2), x/(1-x)). As a product of Riordan arrays, factors into the product of (1/(1+x),x) and (1/(1-x),1/(1-x)) (binomial matrix). - Paul Barry, Oct 25 2004

Signed version is A239473 with relations to partial sums of sequences. - Tom Copeland, Mar 24 2014

From Robert Coquereaux, Oct 01 2014: (Start)

Columns of the triangle (cf. Example below) give alternate partial sums along nw-se diagonals of the Pascal triangle, i.e., sequences A000035, A004526, A002620 (or A087811), A002623 (or A173196), A001752, A001753, A001769, A001779, A001780, A001781, A001786, A001808, etc.

The dimension of the space of closed currents (distributional forms) of degree p on Gr(n), the Grassmann algebra with n generators, equivalently, the dimension of the space of Gr(n)-valued symmetric multilinear forms with vanishing graded divergence, is V(n,p) = 2^n T(p,n-1) - (-1)^p.

If p is odd V(n,p) is also the dimension of the cyclic cohomology group of order p of the Z2 graded algebra Gr(n).

If p is even the dimension of this cohomology group is V(n,p)+1.

Cf. A193844. (End)

From Peter Bala, Feb 07 2024: (Start)

The following remarks assume the row indexing starts at n = 1.

The sequence of row polynomials R(n,x), beginning R(1,x) = 1, R(2,x) = x, R(3,x) = 1 + x + x^2 , ..., is a strong divisibility sequence of polynomials in the ring Z[x]; that is, for all positive integers n and m, poly_gcd( R(n,x), R(m,x)) = R(gcd(n, m), x) - apply Norfleet (2005), Theorem 3. Consequently, the polynomial sequence {R(n,x): n >= 1} is a divisibility sequence; that is, if n divides m then R(n,x) divides R(m,x) in Z[x]. (End)

From Miquel A. Fiol, Oct 04 2024: (Start)

For j>=1, T(i,j) is the independence number of the (i-j)-supertoken graph FF_(i-j)(S_j) of the star graph S_j with j points.

(Given a graph G on n vertices and an integer k>=1, the k-supertoken (or reduced k-th power) FF_k(G) of G has vertices representing configurations of k indistinguishable tokens in the (not necessarily different) vertices of G, with two configurations being adjacent if one can be obtained from the other by moving one token along an edge. See an example below.)

Following the suggestion of Peter Munn, the k-supertoken graph FF_k(S_j) can also be defined as follows: Consider the Lattice graph L(k,j), whose vertices are the k^j j-vectors with elements in the set {0,..,k-1}, two being adjacent if they differ in just one coordinate by one unity. Then, FF_k(S_j) is the subgraph of L(k+1,j) induced by the vertices at distance at most k from (0,..,0). (End)

Also, number of unlabeled bipartite graphs with three left vertices and n right vertices. - Yavuz Oruc, Jan 22 2018

Also Schoenheim bound L_1(n,5,4).

Degrees of polynomials defined by p(n) = (x^(n+1)*p(n-1)p(n-3) + p(n-2)^2)/p(n-4), p(-4)=p(-3)=p(-2)=p(-1)=1. - Michael Somos, Jul 21 2004

Degrees of polynomial tau-functions of q-discrete Painlevé I, which generate sequence A095708 when q=2 (up to an offset of 3). - Andrew Hone, Jul 29 2004

Because of the Laurent phenomenon for the general q-discrete Painlevé I tau-function recurrence p(n) = (a*x^(n+1)*p(n-1)*p(n-3) + b*p(n-2)^2)/p(n-4), p(n) for n > -1 will always be a polynomial in x and a Laurent polynomial in a,b and the initial data p(-4),p(-3),p(-2),p(-1). - Andrew Hone, Jul 29 2004

Create the sequence 0,0,0,0,0,6,18,36,66,108,... so that the sum of three consecutive terms b(n) + b(n+1) + b(n+2) = A007531(n), with b(0)=0; then a(n) = b(n+5)/6. - J. M. Bergot, Jul 30 2013

Number of partitions of n into three kinds of part 1 and one kind of part 3. - Joerg Arndt, Sep 28 2015

First differences are A001840(k) starting with k=2; second differences are A086161(k) starting with k=1. - Bob Selcoe, Sep 28 2015

Maximum Wiener index of all maximal planar graphs with n+2 vertices. The extremal graphs are cubes of paths. - Allan Bickle, Jul 09 2022

Maximum Wiener index of all maximal 3-degenerate graphs with n+2 vertices. (A maximal 3-degenerate graph can be constructed from a 3-clique by iteratively adding a new 3-leaf (vertex of degree 3) adjacent to three existing vertices.) The extremal graphs are cubes of paths, so the bound also applies to 3-trees. - Allan Bickle, Sep 18 2022

Sum_{k=0..n} T(n,k) = A078008(n);

Sum_{k=0..n} abs(T(n,k)) = A052953(n-1) for n > 0;

T(n,1) = n - 2 for n > 1;

T(n,2) = A000124(n-3) for n > 2;

T(n,3) = A003600(n-4) for n > 4;

T(n,n-6) = A001753(n-6) for n > 6;

T(n,n-5) = A001752(n-5) for n > 5;

T(n,n-4) = A002623(n-4) for n > 4;

T(n,n-3) = A002620(n-1) for n > 3;

T(n,n-2) = A008619(n-2) for n > 2;

T(n,n-1) = n mod 2 for n > 0;

T(2*n,n) = A072547(n+1).

Sum_{k=0..n} T(n,k)*x^k = A232015(n), A078008(n), A000012(n), A040000(n), A001045(n+2), A140725(n+1) for x = 2, 1, 0, -1, -2, -3 respectively. - Philippe Deléham, Nov 17 2013, Nov 19 2013

(1,a^n) Pascal triangle with a = -1. - Philippe Deléham, Dec 27 2013

T(n,k) = A112465(n,n-k). - Reinhard Zumkeller, Jan 03 2014

Changing the offset from 2 to 1, this is also the sequence: "Triangle read by rows: T(n,k) is the number of nonequivalent ways to place k non-attacking kings on an n X n board." (For if each king is represented by a 2 X 2 tile with the king in the upper left corner, the kings do not attack each other.) For example, with offset 1, T(4,3) = 20 because there are 20 nonequivalent ways to place 3 kings on a 4 X 4 chessboard so that no king threatens any other. - Heinrich Ludwig and N. J. A. Sloane, Dec 21 2016

It appears that rows 2n and 2n-1 both contain n^2 + 1 entries. Rotations and reflections of placements are not counted. If they are to be counted, see A193580. - Heinrich Ludwig, Dec 11 2016