cp's OEIS Frontend

Also referred to as T(n) or C(n+1, 2) or binomial(n+1, 2) (preferred).

Also generalized hexagonal numbers: n*(2*n-1), n=0, +-1, +-2, +-3, ... Generalized k-gonal numbers are second k-gonal numbers and positive terms of k-gonal numbers interleaved, k >= 5. In this case k = 6. - Omar E. Pol, Sep 13 2011 and Aug 04 2012

Number of edges in complete graph of order n+1, K_{n+1}.

Number of legal ways to insert a pair of parentheses in a string of n letters. E.g., there are 6 ways for three letters: (a)bc, (ab)c, (abc), a(b)c, a(bc), ab(c). Proof: there are C(n+2,2) ways to choose where the parentheses might go, but n + 1 of them are illegal because the parentheses are adjacent. Cf. A002415.

For n >= 1, a(n) is also the genus of a nonsingular curve of degree n+2, such as the Fermat curve x^(n+2) + y^(n+2) = 1. - Ahmed Fares (ahmedfares(AT)my_deja.com), Feb 21 2001

From Harnack's theorem (1876), the number of branches of a nonsingular curve of order n is bounded by a(n-1)+1, and the bound can be achieved. See also A152947. - Benoit Cloitre, Aug 29 2002. Corrected by Robert McLachlan, Aug 19 2024

Number of tiles in the set of double-n dominoes. - Scott A. Brown, Sep 24 2002

Number of ways a chain of n non-identical links can be broken up. This is based on a similar problem in the field of proteomics: the number of ways a peptide of n amino acid residues can be broken up in a mass spectrometer. In general, each amino acid has a different mass, so AB and BC would have different masses. - James A. Raymond, Apr 08 2003

Triangular numbers - odd numbers = shifted triangular numbers; 1, 3, 6, 10, 15, 21, ... - 1, 3, 5, 7, 9, 11, ... = 0, 0, 1, 3, 6, 10, ... - Xavier Acloque, Oct 31 2003 [Corrected by Derek Orr, May 05 2015]

Centered polygonal numbers are the result of [number of sides * A000217 + 1]. E.g., centered pentagonal numbers (1,6,16,31,...) = 5 * (0,1,3,6,...) + 1. Centered heptagonal numbers (1,8,22,43,...) = 7 * (0,1,3,6,...) + 1. - Xavier Acloque, Oct 31 2003

Maximum number of lines formed by the intersection of n+1 planes. - Ron R. King, Mar 29 2004

Number of permutations of [n] which avoid the pattern 132 and have exactly 1 descent. - Mike Zabrocki, Aug 26 2004

Number of ternary words of length n-1 with subwords (0,1), (0,2) and (1,2) not allowed. - Olivier Gérard, Aug 28 2012

Number of ways two different numbers can be selected from the set {0,1,2,...,n} without repetition, or, number of ways two different numbers can be selected from the set {1,2,...,n} with repetition.

Conjecturally, 1, 6, 120 are the only numbers that are both triangular and factorial. - Christopher M. Tomaszewski (cmt1288(AT)comcast.net), Mar 30 2005

Binomial transform is {0, 1, 5, 18, 56, 160, 432, ...}, A001793 with one leading zero. - Philippe Deléham, Aug 02 2005

Each pair of neighboring terms adds to a perfect square. - Zak Seidov, Mar 21 2006

Number of transpositions in the symmetric group of n+1 letters, i.e., the number of permutations that leave all but two elements fixed. - Geoffrey Critzer, Jun 23 2006

With rho(n):=exp(i*2*Pi/n) (an n-th root of 1) one has, for n >= 1, rho(n)^a(n) = (-1)^(n+1). Just use the triviality a(2*k+1) == 0 (mod (2*k+1)) and a(2*k) == k (mod (2*k)).

a(n) is the number of terms in the expansion of (a_1 + a_2 + a_3)^(n-1). - Sergio Falcon, Feb 12 2007

a(n+1) is the number of terms in the complete homogeneous symmetric polynomial of degree n in 2 variables. - Richard Barnes, Sep 06 2017

The number of distinct handshakes in a room with n+1 people. - Mohammad K. Azarian, Apr 12 2007 [corrected, Joerg Arndt, Jan 18 2016]

Equal to the rank (minimal cardinality of a generating set) of the semigroup PT_n\S_n, where PT_n and S_n denote the partial transformation semigroup and symmetric group on [n]. - James East, May 03 2007

a(n) gives the total number of triangles found when cevians are drawn from a single vertex on a triangle to the side opposite that vertex, where n = the number of cevians drawn+1. For instance, with 1 cevian drawn, n = 1+1 = 2 and a(n)= 2*(2+1)/2 = 3 so there is a total of 3 triangles in the figure. If 2 cevians are drawn from one point to the opposite side, then n = 1+2 = 3 and a(n) = 3*(3+1)/2 = 6 so there is a total of 6 triangles in the figure. - Noah Priluck (npriluck(AT)gmail.com), Apr 30 2007

For n >= 1, a(n) is the number of ways in which n-1 can be written as a sum of three nonnegative integers if representations differing in the order of the terms are considered to be different. In other words, for n >= 1, a(n) is the number of nonnegative integral solutions of the equation x + y + z = n-1. - Amarnath Murthy, Apr 22 2001 (edited by Robert A. Beeler)

a(n) is the number of levels with energy n + 3/2 (in units of h*f0, with Planck's constant h and the oscillator frequency f0) of the three-dimensional isotropic harmonic quantum oscillator. See the comment by A. Murthy above: n = n1 + n2 + n3 with positive integers and ordered. Proof from the o.g.f. See the A. Messiah reference. - Wolfdieter Lang, Jun 29 2007

From Hieronymus Fischer, Aug 06 2007: (Start)

Numbers m >= 0 such that round(sqrt(2m+1)) - round(sqrt(2m)) = 1.

Numbers m >= 0 such that ceiling(2*sqrt(2m+1)) - 1 = 1 + floor(2*sqrt(2m)).

Numbers m >= 0 such that fract(sqrt(2m+1)) > 1/2 and fract(sqrt(2m)) < 1/2, where fract(x) is the fractional part of x (i.e., x - floor(x), x >= 0). (End)

If Y and Z are 3-blocks of an n-set X, then, for n >= 6, a(n-1) is the number of (n-2)-subsets of X intersecting both Y and Z. - Milan Janjic, Nov 09 2007

Equals row sums of triangle A143320, n > 0. - Gary W. Adamson, Aug 07 2008

a(n) is also an even perfect number in A000396 iff n is a Mersenne prime A000668. - Omar E. Pol, Sep 05 2008. Unnecessary assumption removed and clarified by Rick L. Shepherd, Apr 14 2025

Equals row sums of triangle A152204. - Gary W. Adamson, Nov 29 2008

The number of matches played in a round robin tournament: n*(n-1)/2 gives the number of matches needed for n players. Everyone plays against everyone else exactly once. - Georg Wrede (georg(AT)iki.fi), Dec 18 2008

-a(n+1) = E(2)*binomial(n+2,2) (n >= 0) where E(n) are the Euler numbers in the enumeration A122045. Viewed this way, a(n) is the special case k=2 in the sequence of diagonals in the triangle A153641. - Peter Luschny, Jan 06 2009

Equivalent to the first differences of successive tetrahedral numbers. See A000292. - Jeremy Cahill (jcahill(AT)inbox.com), Apr 15 2009

The general formula for alternating sums of powers is in terms of the Swiss-Knife polynomials P(n,x) A153641 2^(-n-1)(P(n,1)-(-1)^k P(n,2k+1)). Thus a(k) = |2^(-3)(P(2,1)-(-1)^k P(2,2k+1))|. - Peter Luschny, Jul 12 2009

a(n) is the smallest number > a(n-1) such that gcd(n,a(n)) = gcd(n,a(n-1)). If n is odd this gcd is n; if n is even it is n/2. - Franklin T. Adams-Watters, Aug 06 2009

Partial sums of A001477. - Juri-Stepan Gerasimov, Jan 25 2010. [A-number corrected by Omar E. Pol, Jun 05 2012]

The numbers along the right edge of Floyd's triangle are 1, 3, 6, 10, 15, .... - Paul Muljadi, Jan 25 2010

From Charlie Marion, Dec 03 2010: (Start)

More generally, a(2k+1) == j*(2j-1) (mod 2k+2j+1) and

a(2k) == [-k + 2j*(j-1)] (mod 2k+2j).

Column sums of:

1 3 5 7 9 ...

1 3 5 ...

1 ...

...............

---------------

1 3 6 10 15 ...

Sum_{n>=1} 1/a(n)^2 = 4*Pi^2/3-12 = 12 less than the volume of a sphere with radius Pi^(1/3).

(End)

A004201(a(n)) = A000290(n); A004202(a(n)) = A002378(n). - Reinhard Zumkeller, Feb 12 2011

1/a(n+1), n >= 0, has e.g.f. -2*(1+x-exp(x))/x^2, and o.g.f. 2*(x+(1-x)*log(1-x))/x^2 (see the Stephen Crowley formula line). -1/(2*a(n+1)) is the z-sequence for the Sheffer triangle of the coefficients of the Bernoulli polynomials A196838/A196839. - Wolfdieter Lang, Oct 26 2011

From Charlie Marion, Feb 23 2012: (Start)

a(n) + a(A002315(k)*n + A001108(k+1)) = (A001653(k+1)*n + A001109(k+1))^2. For k=0 we obtain a(n) + a(n+1) = (n+1)^2 (identity added by N. J. A. Sloane on Feb 19 2004).

a(n) + a(A002315(k)*n - A055997(k+1)) = (A001653(k+1)*n - A001109(k))^2.

(End)

Plot the three points (0,0), (a(n), a(n+1)), (a(n+1), a(n+2)) to form a triangle. The area will be a(n+1)/2. - J. M. Bergot, May 04 2012

The sum of four consecutive triangular numbers, beginning with a(n)=n*(n+1)/2, minus 2 is 2*(n+2)^2. a(n)*a(n+2)/2 = a(a(n+1)-1). - J. M. Bergot, May 17 2012

(a(n)*a(n+3) - a(n+1)*a(n+2))*(a(n+1)*a(n+4) - a(n+2)*a(n+3))/8 = a((n^2+5*n+4)/2). - J. M. Bergot, May 18 2012

a(n)*a(n+1) + a(n+2)*a(n+3) + 3 = a(n^2 + 4*n + 6). - J. M. Bergot, May 22 2012

In general, a(n)*a(n+1) + a(n+k)*a(n+k+1) + a(k-1)*a(k) = a(n^2 + (k+2)*n + k*(k+1)). - Charlie Marion, Sep 11 2012

a(n)*a(n+3) + a(n+1)*a(n+2) = a(n^2 + 4*n + 2). - J. M. Bergot, May 22 2012

In general, a(n)*a(n+k) + a(n+1)*a(n+k-1) = a(n^2 + (k+1)*n + k-1). - Charlie Marion, Sep 11 2012

a(n)*a(n+2) + a(n+1)*a(n+3) = a(n^2 + 4*n + 3). - J. M. Bergot, May 22 2012

Three points (a(n),a(n+1)), (a(n+1),a(n)) and (a(n+2),a(n+3)) form a triangle with area 4*a(n+1). - J. M. Bergot, May 23 2012

a(n) + a(n+k) = (n+k)^2 - (k^2 + (2n-1)*k -2n)/2. For k=1 we obtain a(n) + a(n+1) = (n+1)^2 (see below). - Charlie Marion, Oct 02 2012

In n-space we can define a(n-1) nontrivial orthogonal projections. For example, in 3-space there are a(2)=3 (namely point onto line, point onto plane, line onto plane). - Douglas Latimer, Dec 17 2012

From James East, Jan 08 2013: (Start)

For n >= 1, a(n) is equal to the rank (minimal cardinality of a generating set) and idempotent rank (minimal cardinality of an idempotent generating set) of the semigroup P_n\S_n, where P_n and S_n denote the partition monoid and symmetric group on [n].

For n >= 3, a(n-1) is equal to the rank and idempotent rank of the semigroup T_n\S_n, where T_n and S_n denote the full transformation semigroup and symmetric group on [n].

(End)

For n >= 3, a(n) is equal to the rank and idempotent rank of the semigroup PT_n\S_n, where PT_n and S_n denote the partial transformation semigroup and symmetric group on [n]. - James East, Jan 15 2013

Conjecture: For n > 0, there is always a prime between A000217(n) and A000217(n+1). Sequence A065383 has the first 1000 of these primes. - Ivan N. Ianakiev, Mar 11 2013

The formula, a(n)*a(n+4k+2)/2 + a(k) = a(a(n+2k+1) - (k^2+(k+1)^2)), is a generalization of the formula a(n)*a(n+2)/2 = a(a(n+1)-1) in Bergot's comment dated May 17 2012. - Charlie Marion, Mar 28 2013

The series Sum_{k>=1} 1/a(k) = 2, given in a formula below by Jon Perry, Jul 13 2003, has partial sums 2*n/(n+1) (telescopic sum) = A022998(n)/A026741(n+1). - Wolfdieter Lang, Apr 09 2013

For odd m = 2k+1, we have the recurrence a(m*n + k) = m^2*a(n) + a(k). Corollary: If number T is in the sequence then so is 9*T+1. - Lekraj Beedassy, May 29 2013

Euler, in Section 87 of the Opera Postuma, shows that whenever T is a triangular number then 9*T + 1, 25*T + 3, 49*T + 6 and 81*T + 10 are also triangular numbers. In general, if T is a triangular number then (2*k + 1)^2*T + k*(k + 1)/2 is also a triangular number. - Peter Bala, Jan 05 2015

Using 1/b and 1/(b+2) will give a Pythagorean triangle with sides 2*b + 2, b^2 + 2*b, and b^2 + 2*b + 2. Set b=n-1 to give a triangle with sides of lengths 2*n,n^2-1, and n^2 + 1. One-fourth the perimeter = a(n) for n > 1. - J. M. Bergot, Jul 24 2013

a(n) = A028896(n)/6, where A028896(n) = s(n) - s(n-1) are the first differences of s(n) = n^3 + 3*n^2 + 2*n - 8. s(n) can be interpreted as the sum of the 12 edge lengths plus the sum of the 6 face areas plus the volume of an n X (n-1) X (n-2) rectangular prism. - J. M. Bergot, Aug 13 2013

Dimension of orthogonal group O(n+1). - Eric M. Schmidt, Sep 08 2013

Number of positive roots in the root system of type A_n (for n > 0). - Tom Edgar, Nov 05 2013

A formula for the r-th successive summation of k, for k = 1 to n, is binomial(n+r,r+1) [H. W. Gould]. - Gary Detlefs, Jan 02 2014

Also the alternating row sums of A095831. Also the alternating row sums of A055461, for n >= 1. - Omar E. Pol, Jan 26 2014

For n >= 3, a(n-2) is the number of permutations of 1,2,...,n with the distribution of up (1) - down (0) elements 0...011 (n-3 zeros), or, the same, a(n-2) is up-down coefficient {n,3} (see comment in A060351). - Vladimir Shevelev, Feb 14 2014

a(n) is the dimension of the vector space of symmetric n X n matrices. - Derek Orr, Mar 29 2014

Non-vanishing subdiagonal of A132440^2/2, aside from the initial zero. First subdiagonal of unsigned A238363. Cf. A130534 for relations to colored forests, disposition of flags on flagpoles, and colorings of the vertices of complete graphs. - Tom Copeland, Apr 05 2014

The number of Sidon subsets of {1,...,n+1} of size 2. - Carl Najafi, Apr 27 2014

Number of factors in the definition of the Vandermonde determinant V(x_1,x_2,...,x_n) = Product_{1 <= i < k <= n} x_i - x_k. - Tom Copeland, Apr 27 2014

Number of weak compositions of n into three parts. - Robert A. Beeler, May 20 2014

Suppose a bag contains a(n) red marbles and a(n+1) blue marbles, where a(n), a(n+1) are consecutive triangular numbers. Then, for n > 0, the probability of choosing two marbles at random and getting two red or two blue is 1/2. In general, for k > 2, let b(0) = 0, b(1) = 1 and, for n > 1, b(n) = (k-1)*b(n-1) - b(n-2) + 1. Suppose, for n > 0, a bag contains b(n) red marbles and b(n+1) blue marbles. Then the probability of choosing two marbles at random and getting two red or two blue is (k-1)/(k+1). See also A027941, A061278, A089817, A053142, A092521. - Charlie Marion, Nov 03 2014

Let O(n) be the oblong number n(n+1) = A002378 and S(n) the square number n^2 = A000290(n). Then a(4n) = O(3n) - O(n), a(4n+1) = S(3n+1) - S(n), a(4n+2) = S(3n+2) - S(n+1) and a(4n+3) = O(3n+2) - O(n). - Charlie Marion, Feb 21 2015

Consider the partition of the natural numbers into parts from the set S=(1,2,3,...,n). The length (order) of the signature of the resulting sequence is given by the triangular numbers. E.g., for n=10, the signature length is 55. - David Neil McGrath, May 05 2015

a(n) counts the partitions of (n-1) unlabeled objects into three (3) parts (labeled a,b,c), e.g., a(5)=15 for (n-1)=4. These are (aaaa),(bbbb),(cccc),(aaab),(aaac),(aabb),(aacc),(aabc),(abbc),(abcc),(abbb),(accc),(bbcc),(bccc),(bbbc). - David Neil McGrath, May 21 2015

Conjecture: the sequence is the genus/deficiency of the sinusoidal spirals of index n which are algebraic curves. The value 0 corresponds to the case of the Bernoulli Lemniscate n=2. So the formula conjectured is (n-1)(n-2)/2. - Wolfgang Tintemann, Aug 02 2015

Conjecture: Let m be any positive integer. Then, for each n = 1,2,3,... the set {Sum_{k=s..t} 1/k^m: 1 <= s <= t <= n} has cardinality a(n) = n*(n+1)/2; in other words, all the sums Sum_{k=s..t} 1/k^m with 1 <= s <= t are pairwise distinct. (I have checked this conjecture via a computer and found no counterexample.) - Zhi-Wei Sun, Sep 09 2015

The Pisano period lengths of reading the sequence modulo m seem to be A022998(m). - R. J. Mathar, Nov 29 2015

For n >= 1, a(n) is the number of compositions of n+4 into n parts avoiding the part 2. - Milan Janjic, Jan 07 2016

In this sequence only 3 is prime. - Fabian Kopp, Jan 09 2016

Suppose you are playing Bulgarian Solitaire (see A242424 and Chamberland's and Gardner's books) and, for n > 0, you are starting with a single pile of a(n) cards. Then the number of operations needed to reach the fixed state {n, n-1,...,1} is a(n-1). For example, {6}->{5,1}->{4,2}->{3,2,1}. - Charlie Marion, Jan 14 2016

Numbers k such that 8k + 1 is a square. - Juri-Stepan Gerasimov, Apr 09 2016

Every perfect cube is the difference of the squares of two consecutive triangular numbers. 1^2-0^2 = 1^3, 3^2-1^2 = 2^3, 6^2-3^2 = 3^3. - Miquel Cerda, Jun 26 2016

For n > 1, a(n) = tau_n(k*) where tau_n(k) is the number of ordered n-factorizations of k and k* is the square of a prime. For example, tau_3(4) = tau_3(9) = tau_3(25) = tau_3(49) = 6 (see A007425) since the number of divisors of 4, 9, 25, and 49's divisors is 6, and a(3) = 6. - Melvin Peralta, Aug 29 2016

In an (n+1)-dimensional hypercube, number of two-dimensional faces congruent with a vertex (see also A001788). - Stanislav Sykora, Oct 23 2016

Generalizations of the familiar formulas, a(n) + a(n+1) = (n+1)^2 (Feb 19 2004) and a(n)^2 + a(n+1)^2 = a((n+1)^2) (Nov 22 2006), follow: a(n) + a(n+2k-1) + 4a(k-1) = (n+k)^2 + 6a(k-1) and a(n)^2 + a(n+2k-1)^2 + (4a(k-1))^2 + 3a(k-1) = a((n+k)^2 + 6a(k-1)). - Charlie Marion, Nov 27 2016

a(n) is also the greatest possible number of diagonals in a polyhedron with n+4 vertices. - Vladimir Letsko, Dec 19 2016

For n > 0, 2^5 * (binomial(n+1,2))^2 represents the first integer in a sum of 2*(2*n + 1)^2 consecutive integers that equals (2*n + 1)^6. - Patrick J. McNab, Dec 25 2016

Does not satisfy Benford's law (cf. Ross, 2012). - N. J. A. Sloane, Feb 12 2017

Number of ordered triples (a,b,c) of positive integers not larger than n such that a+b+c = 2n+1. - Aviel Livay, Feb 13 2017

Number of inequivalent tetrahedral face colorings using at most n colors so that no color appears only once. - David Nacin, Feb 22 2017

Also the Wiener index of the complete graph K_{n+1}. - Eric W. Weisstein, Sep 07 2017

Number of intersections between the Bernstein polynomials of degree n. - Eric Desbiaux, Apr 01 2018

a(n) is the area of a triangle with vertices at (1,1), (n+1,n+2), and ((n+1)^2, (n+2)^2). - Art Baker, Dec 06 2018

For n > 0, a(n) is the smallest k > 0 such that n divides numerator of (1/a(1) + 1/a(2) + ... + 1/a(n-1) + 1/k). It should be noted that 1/1 + 1/3 + 1/6 + ... + 2/(n(n+1)) = 2n/(n+1). - Thomas Ordowski, Aug 04 2019

Upper bound of the number of lines in an n-homogeneous supersolvable line arrangement (see Theorem 1.1 in Dimca). - Stefano Spezia, Oct 04 2019

For n > 0, a(n+1) is the number of lattice points on a triangular grid with side length n. - Wesley Ivan Hurt, Aug 12 2020

From Michael Chu, May 04 2022: (Start)

Maximum number of distinct nonempty substrings of a string of length n.

Maximum cardinality of the sumset A+A, where A is a set of n numbers. (End)

a(n) is the number of parking functions of size n avoiding the patterns 123, 132, and 312. - Lara Pudwell, Apr 10 2023

Suppose two rows, each consisting of n evenly spaced dots, are drawn in parallel. Suppose we bijectively draw lines between the dots of the two rows. For n >= 1, a(n - 1) is the maximal possible number of intersections between the lines. Equivalently, the maximal number of inversions in a permutation of [n]. - Sela Fried, Apr 18 2023

The following equation complements the generalization in Bala's Comment (Jan 05 2015). (2k + 1)^2*a(n) + a(k) = a((2k + 1)*n + k). - Charlie Marion, Aug 28 2023

a(n) + a(n+k) + a(k-1) + (k-1)*n = (n+k)^2. For k = 1, we have a(n) + a(n+1) = (n+1)^2. - Charlie Marion, Nov 17 2023

a(n+1)/3 is the expected number of steps to escape from a linear row of n positions starting at a random location and randomly performing steps -1 or +1 with equal probability. - Hugo Pfoertner, Jul 22 2025

a(n+1) is the number of nonnegative integer solutions to p + q + r = n. By Sylvester's law of inertia, it is also the number of congruence classes of real symmetric n-by-n matrices or equivalently, the number of symmetric bilinear forms on a real n-dimensional vector space. - Paawan Jethva, Jul 24 2025

a(n) is the number of balls in a triangular pyramid in which each edge contains n balls.

One of the 5 Platonic polyhedral (tetrahedral, cube, octahedral, dodecahedral and icosahedral) numbers (cf. A053012).

Also (1/6)*(n^3 + 3*n^2 + 2*n) is the number of ways to color the vertices of a triangle using <= n colors, allowing rotations and reflections. Group is the dihedral group D_6 with cycle index (x1^3 + 2*x3 + 3*x1*x2)/6.

Also the convolution of the natural numbers with themselves. - Felix Goldberg (felixg(AT)tx.technion.ac.il), Feb 01 2001

Connected with the Eulerian numbers (1, 4, 1) via 1*a(n-2) + 4*a(n-1) + 1*a(n) = n^3. - Gottfried Helms, Apr 15 2002

a(n) is sum of all the possible products p*q where (p,q) are ordered pairs and p + q = n + 1. E.g., a(5) = 5 + 8 + 9 + 8 + 5 = 35. - Amarnath Murthy, May 29 2003

Number of labeled graphs on n+3 nodes that are triangles. - Jon Perry, Jun 14 2003

Number of permutations of n+3 which have exactly 1 descent and avoid the pattern 1324. - Mike Zabrocki, Nov 05 2004

Schlaefli symbol for this polyhedron: {3,3}.

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

a(n) is a perfect square only for n = {1, 2, 48}. E.g., a(48) = 19600 = 140^2. - Alexander Adamchuk, Nov 24 2006

a(n+1) is the number of terms in the expansion of (a_1 + a_2 + a_3 + a_4)^n. - Sergio Falcon, Feb 12 2007 [Corrected by Graeme McRae, Aug 28 2007]

a(n+1) is the number of terms in the complete homogeneous symmetric polynomial of degree n in 3 variables. - Richard Barnes, Sep 06 2017

This is also the average "permutation entropy", sum((pi(n)-n)^2)/n!, over the set of all possible n! permutations pi. - Jeff Boscole (jazzerciser(AT)hotmail.com), Mar 20 2007

a(n) = (d/dx)(S(n, x), x)|A049310.%20-%20_Wolfdieter%20Lang">{x = 2}. First derivative of Chebyshev S-polynomials evaluated at x = 2. See A049310. - _Wolfdieter Lang, Apr 04 2007

If X is an n-set and Y a fixed (n-1)-subset of X then a(n-2) is equal to the number of 3-subsets of X intersecting Y. - Milan Janjic, Aug 15 2007

Complement of A145397; A023533(a(n))=1; A014306(a(n))=0. - Reinhard Zumkeller, Oct 14 2008

Equals row sums of triangle A152205. - Gary W. Adamson, Nov 29 2008

a(n) is the number of gifts received from the lyricist's true love up to and including day n in the song "The Twelve Days of Christmas". a(12) = 364, almost the number of days in the year. - Bernard Hill (bernard(AT)braeburn.co.uk), Dec 05 2008

Sequence of the absolute values of the z^1 coefficients of the polynomials in the GF2 denominators of A156925. See A157703 for background information. - Johannes W. Meijer, Mar 07 2009

Starting with 1 = row sums of triangle A158823. - Gary W. Adamson, Mar 28 2009

Wiener index of the path with n edges. - Eric W. Weisstein, Apr 30 2009

This is a 'Matryoshka doll' sequence with alpha=0, the multiplicative counterpart is A000178: seq(add(add(i,i=alpha..k),k=alpha..n),n=alpha..50). - Peter Luschny, Jul 14 2009

a(n) is the number of nondecreasing triples of numbers from a set of size n, and it is the number of strictly increasing triples of numbers from a set of size n+2. - Samuel Savitz, Sep 12 2009 [Corrected and enhanced by Markus Sigg, Sep 24 2023]

a(n) is the number of ordered sequences of 4 nonnegative integers that sum to n. E.g., a(2) = 10 because 2 = 2 + 0 + 0 + 0 = 1 + 1 + 0 + 0 = 0 + 2 + 0 + 0 = 1 + 0 + 1 + 0 = 0 + 1 + 1 + 0 = 0 + 0 + 2 + 0 = 1 + 0 + 0 + 1 = 0 + 1 + 0 + 1 = 0 + 0 + 1 + 1 = 0 + 0 + 0 + 2. - Artur Jasinski, Nov 30 2009

a(n) corresponds to the total number of steps to memorize n verses by the technique described in A173964. - Ibrahima Faye (ifaye2001(AT)yahoo.fr), Feb 22 2010

The number of (n+2)-bit numbers which contain two runs of 1's in their binary expansion. - Vladimir Shevelev, Jul 30 2010

a(n) is also, starting at the second term, the number of triangles formed in n-gons by intersecting diagonals with three diagonal endpoints (see the first column of the table in Sommars link). - Alexandre Wajnberg, Aug 21 2010

Column sums of:

1 4 9 16 25...

1 4 9...

1...

..............

--------------

1 4 10 20 35...

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

The Ca3, Ca4, Gi3 and Gi4 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., Gi3(n) = 17*a(n) + 19*a(n-1) and Gi4(n) = 5*a(n) + a(n-1).

Furthermore the Kn3, Kn4, Ca3, Ca4, Gi3 and Gi4 triangle sums of the Connell sequence A001614 as a triangle are also linear sums of shifted versions of the sequence given above. (End)

a(n-2)=N_0(n), n >= 1, with a(-1):=0, is the number of vertices of n planes in generic position in three-dimensional space. See a comment under A000125 for general arrangement. Comment to Arnold's problem 1990-11, see the Arnold reference, p. 506. - Wolfdieter Lang, May 27 2011

We consider optimal proper vertex colorings of a graph G. Assume that the labeling, i.e., coloring starts with 1. By optimality we mean that the maximum label used is the minimum of the maximum integer label used across all possible labelings of G. Let S=Sum of the differences |l(v) - l(u)|, the sum being over all edges uv of G and l(w) is the label associated with a vertex w of G. We say G admits unique labeling if all possible labelings of G is S-invariant and yields the same integer partition of S. With an offset this sequence gives the S-values for the complete graph on n vertices, n = 2, 3, ... . - K.V.Iyer, Jul 08 2011

Central term of commutator of transverse Virasoro operators in 4-D case for relativistic quantum open strings (ref. Zwiebach). - Tom Copeland, Sep 13 2011

Appears as a coefficient of a Sturm-Liouville operator in the Ovsienko reference on page 43. - Tom Copeland, Sep 13 2011

For n > 0: a(n) is the number of triples (u,v,w) with 1 <= u <= v <= w <= n, cf. A200737. - Reinhard Zumkeller, Nov 21 2011

Regarding the second comment above by Amarnath Murthy (May 29 2003), see A181118 which gives the sequence of ordered pairs. - L. Edson Jeffery, Dec 17 2011

The dimension of the space spanned by the 3-form v[ijk] that couples to M2-brane worldsheets wrapping 3-cycles inside tori (ref. Green, Miller, Vanhove eq. 3.9). - Stephen Crowley, Jan 05 2012

a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = n. Also, a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = 3*n. - Clark Kimberling, Mar 19 2012

Using n + 4 consecutive triangular numbers t(1), t(2), ..., t(n+4), where n is the n-th term of this sequence, create a polygon by connecting points (t(1), t(2)) to (t(2), t(3)), (t(2), t(3)) to (t(3), t(4)), ..., (t(1), t(2)) to (t(n+3), t(n+4)). The area of this polygon will be one-half of each term in this sequence. - J. M. Bergot, May 05 2012

Pisano period lengths: 1, 4, 9, 8, 5, 36, 7, 16, 27, 20, 11, 72, 13, 28, 45, 32, 17,108, 19, 40, ... . (The Pisano sequence modulo m is the auxiliary sequence p(n) = a(n) mod m, n >= 1, for some m. p(n) is periodic for all sequences with rational g.f., like this one, and others. The lengths of the period of p(n) are quoted here for m>=1.) - R. J. Mathar, Aug 10 2012

a(n) is the maximum possible number of rooted triples consistent with any phylogenetic tree (level-0 phylogenetic network) containing exactly n+2 leaves. - Jesper Jansson, Sep 10 2012

For n > 0, the digital roots of this sequence A010888(a(n)) form the purely periodic 27-cycle {1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 9, 9, 9}, which just rephrases the Pisano period length above. - Ant King, Oct 18 2012

a(n) is the number of functions f from {1, 2, 3} to {1, 2, ..., n + 4} such that f(1) + 1 < f(2) and f(2) + 1 < f(3). - Dennis P. Walsh, Nov 27 2012

a(n) is the Szeged index of the path graph with n+1 vertices; see the Diudea et al. reference, p. 155, Eq. (5.8). - Emeric Deutsch, Aug 01 2013

Also the number of permutations of length n that can be sorted by a single block transposition. - Vincent Vatter, Aug 21 2013

From J. M. Bergot, Sep 10 2013: (Start)

a(n) is the 3 X 3 matrix determinant

| C(n,1) C(n,2) C(n,3) |

| C(n+1,1) C(n+1,2) C(n+1,3) |

| C(n+2,1) C(n+2,2) C(n+2,3) |

(End)

In physics, a(n)/2 is the trace of the spin operator S_z^2 for a particle with spin S=n/2. For example, when S=3/2, the S_z eigenvalues are -3/2, -1/2, +1/2, +3/2 and the sum of their squares is 10/2 = a(3)/2. - Stanislav Sykora, Nov 06 2013

a(n+1) = (n+1)*(n+2)*(n+3)/6 is also the dimension of the Hilbert space of homogeneous polynomials of degree n. - L. Edson Jeffery, Dec 12 2013

For n >= 4, a(n-3) is the number of permutations of 1,2...,n with the distribution of up (1) - down (0) elements 0...0111 (n-4 zeros), or, equivalently, a(n-3) is up-down coefficient {n,7} (see comment in A060351). - Vladimir Shevelev, Feb 15 2014

a(n) is one-half the area of the region created by plotting the points (n^2,(n+1)^2). A line connects points (n^2,(n+1)^2) and ((n+1)^2, (n+2)^2) and a line is drawn from (0,1) to each increasing point. From (0,1) to (4,9) the area is 2; from (0,1) to (9,16) the area is 8; further areas are 20,40,70,...,2*a(n). - J. M. Bergot, May 29 2014

Beukers and Top prove that no tetrahedral number > 1 equals a square pyramidal number A000330. - Jonathan Sondow, Jun 21 2014

a(n+1) is for n >= 1 the number of nondecreasing n-letter words over the alphabet [4] = {1, 2, 3, 4} (or any other four distinct numbers). a(2+1) = 10 from the words 11, 22, 33, 44, 12, 13, 14, 23, 24, 34; which is also the maximal number of distinct elements in a symmetric 4 X 4 matrix. Inspired by the Jul 20 2014 comment by R. J. Cano on A000582. - Wolfdieter Lang, Jul 29 2014

Degree of the q-polynomial counting the orbits of plane partitions under the action of the symmetric group S3. Orbit-counting generating function is Product_{i <= j <= k <= n} ( (1 - q^(i + j + k - 1))/(1 - q^(i + j + k - 2)) ). See q-TSPP reference. - Olivier Gérard, Feb 25 2015

Row lengths of tables A248141 and A248147. - Reinhard Zumkeller, Oct 02 2014

If n is even then a(n) = Sum_{k=1..n/2} (2k)^2. If n is odd then a(n) = Sum_{k=0..(n-1)/2} (1+2k)^2. This can be illustrated as stacking boxes inside a square pyramid on plateaus of edge lengths 2k or 2k+1, respectively. The largest k are the 2k X 2k or (2k+1) X (2k+1) base. - R. K. Guy, Feb 26 2015

Draw n lines in general position in the plane. Any three define a triangle, so in all we see C(n,3) = a(n-2) triangles (6 lines produce 4 triangles, and so on). - Terry Stickels, Jul 21 2015

a(n-2) = fallfac(n,3)/3!, n >= 3, is also the number of independent components of an antisymmetric tensor of rank 3 and dimension n. Here fallfac is the falling factorial. - Wolfdieter Lang, Dec 10 2015

Number of compositions (ordered partitions) of n+3 into exactly 4 parts. - Juergen Will, Jan 02 2016

Number of weak compositions (ordered weak partitions) of n-1 into exactly 4 parts. - Juergen Will, Jan 02 2016

For n >= 2 gives the number of multiplications of two nonzero matrix elements in calculating the product of two upper n X n triangular matrices. - John M. Coffey, Jun 23 2016

Terms a(4n+1), n >= 0, are odd, all others are even. The 2-adic valuation of the subsequence of every other term, a(2n+1), n >= 0, yields the ruler sequence A007814. Sequence A275019 gives the 2-adic valuation of a(n). - M. F. Hasler, Dec 05 2016

Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 12 2017

C(n+2,3) is the number of ways to select 1 triple among n+2 objects, thus a(n) is the coefficient of x1^(n-1)*x3 in exponential Bell polynomial B_{n+2}(x1,x2,...), hence its link with A050534 and A001296 (see formula). - Cyril Damamme, Feb 26 2018

a(n) is also the number of 3-cycles in the (n+4)-path complement graph. - Eric W. Weisstein, Apr 11 2018

a(n) is the general number of all geodetic graphs of diameter n homeomorphic to a complete graph K4. - Carlos Enrique Frasser, May 24 2018

a(n) + 4*a(n-1) + a(n-2) = n^3 = A000578(n), for n >= 0 (extending the a(n) formula given in the name). This is the Worpitzky identity for cubes. (Number of components of the decomposition of a rank 3 tensor in dimension n >= 1 into symmetric, mixed and antisymmetric parts). For a(n-2) see my Dec 10 2015 comment. - Wolfdieter Lang, Jul 16 2019

a(n) also gives the total number of regular triangles of length k (in some length unit), with k from {1, 2, ..., n}, in the matchstick arrangement with enclosing triangle of length n, but only triangles with the orientation of the enclosing triangle are counted. Row sums of unsigned A122432(n-1, k-1), for n >= 1. See the Andrew Howroyd comment in A085691. - Wolfdieter Lang, Apr 06 2020

a(n) is the number of bigrassmannian permutations on n+1 elements, i.e., permutations which have a unique left descent, and a unique right descent. - Rafael Mrden, Aug 21 2020

a(n-2) is the number of chiral pairs of colorings of the edges or vertices of a triangle using n or fewer colors. - Robert A. Russell, Oct 20 2020

a(n-2) is the number of subsets of {1,2,...,n} whose diameters are their size. For example, for n=4, a(2)=4 and the sets are {1,3}, {2,4}, {1,2,4}, {1,3,4}. - Enrique Navarrete, Dec 26 2020

For n>1, a(n-2) is the number of subsets of {1,2,...,n} in which the second largest element is the size of the subset. For example, for n=4, a(2)=4 and the sets are {2,3}, {2,4}, {1,3,4}, {2,3,4}. - Enrique Navarrete, Jan 02 2021

a(n) is the number of binary strings of length n+2 with exactly three 0's. - Enrique Navarrete, Jan 15 2021

From Tom Copeland, Jun 07 2021: (Start)

Aside from the zero, this sequence is the fourth diagonal of the Pascal matrix A007318 and the only nonvanishing diagonal (fourth) of the matrix representation IM = (A132440)^3/3! of the differential operator D^3/3!, when acting on the row vector of coefficients of an o.g.f., or power series.

M = e^{IM} is the lower triangular matrix of coefficients of the Appell polynomial sequence p_n(x) = e^{D^3/3!} x^n = e^{b. D} x^n = (b. + x)^n = Sum_{k=0..n} binomial(n,k) b_n x^{n-k}, where the (b.)^n = b_n have the e.g.f. e^{b.t} = e^{t^3/3!}, which is that for A025035 aerated with double zeros, the first column of M.

See A099174 and A000332 for analogous relationships for the third and fifth diagonals of the Pascal matrix. (End)

a(n) is the number of circles with a radius of integer length >= 1 and center at a grid point in an n X n grid. - Albert Swafford, Jun 11 2021

Maximum Wiener index over all connected graphs with n+1 vertices. - Allan Bickle, Jul 09 2022

The third Euler row (1,4,1) has an additional connection with the tetrahedral numbers besides the n^3 identity stated above: a^2(n) + 4*a^2(n+1) + a^2(n+2) = a(n^2+4n+4), which can be shown with algebra. E.g., a^2(2) + 4*a^2(3) + a^2(4) = 16 + 400 + 400 = a(16). Although an analogous thing happens with the (1,1) row of Euler's triangle and triangular numbers C(n+1,2) = A000217(n) = T(n), namely both T(n-1) + T(n) = n^2 and T^2(n-1) + T^2(n) = T(n^2) are true, only one (the usual identity) still holds for the Euler row (1,11,11,1) and the C(n,4) numbers in A000332. That is, the dot product of (1,11,11,1) with the squares of 4 consecutive terms of A000332 is not generally a term of A000332. - Richard Peterson, Aug 21 2022

For n > 1, a(n-2) is the number of solutions of the Diophantine equation x1 + x2 + x3 + x4 + x5 = n, subject to the constraints 0 <= x1, 1 <= x2, 2 <= x3, 0 <= x4 <= 1, 0 <= x5 and x5 is even. - Daniel Checa, Nov 03 2022

a(n+1) is also the number of vertices of the generalized Pitman-Stanley polytope with parameters 2, n, and vector (1,1, ... ,1), which is integrally equivalent to a flow polytope over the grid graph having 2 rows and n columns. - William T. Dugan, Sep 18 2023

a(n) is the number of binary words of length (n+1) containing exactly one substring 01. a(2) = 4: 001, 010, 011, 101. - Nordine Fahssi, Dec 09 2024

4*a(n) + 1 are the odd squares A016754(n).

The word "pronic" (used by Dickson) is incorrect. - Michael Somos

According to the 2nd edition of Webster, the correct word is "promic". - R. K. Guy

a(n) is the number of minimal vectors in the root lattice A_n (see Conway and Sloane, p. 109).

Let M_n denote the n X n matrix M_n(i, j) = (i + j); then the characteristic polynomial of M_n is x^(n-2) * (x^2 - a(n)*x - A002415(n)). - Benoit Cloitre, Nov 09 2002

The greatest LCM of all pairs (j, k) for j < k <= n for n > 1. - Robert G. Wilson v, Jun 19 2004

First differences are a(n+1) - a(n) = 2*n + 2 = 2, 4, 6, ... (while first differences of the squares are (n+1)^2 - n^2 = 2*n + 1 = 1, 3, 5, ...). - Alexandre Wajnberg, Dec 29 2005

25 appended to these numbers corresponds to squares of numbers ending in 5 (i.e., to squares of A017329). - Lekraj Beedassy, Mar 24 2006

A rapid (mental) multiplication/factorization technique -- a generalization of Lekraj Beedassy's comment: For all bases b >= 2 and positive integers n, c, d, k with c + d = b^k, we have (n*b^k + c)*(n*b^k + d) = a(n)*b^(2*k) + c*d. Thus the last 2*k base-b digits of the product are exactly those of c*d -- including leading 0(s) as necessary -- with the preceding base-b digit(s) the same as a(n)'s. Examples: In decimal, 113*117 = 13221 (as n = 11, b = 10 = 3 + 7, k = 1, 3*7 = 21, and a(11) = 132); in octal, 61*67 = 5207 (52 is a(6) in octal). In particular, for even b = 2*m (m > 0) and c = d = m, such a product is a square of this type. Decimal factoring: 5609 is immediately seen to be 71*79. Likewise, 120099 = 301*399 (k = 2 here) and 99990000001996 = 9999002*9999998 (k = 3). - Rick L. Shepherd, Jul 24 2021

Number of circular binary words of length n + 1 having exactly one occurrence of 01. Example: a(2) = 6 because we have 001, 010, 011, 100, 101 and 110. Column 1 of A119462. - Emeric Deutsch, May 21 2006

The sequence of iterated square roots sqrt(N + sqrt(N + ...)) has for N = 1, 2, ... the limit (1 + sqrt(1 + 4*N))/2. For N = a(n) this limit is n + 1, n = 1, 2, .... For all other numbers N, N >= 1, this limit is not a natural number. Examples: n = 1, a(1) = 2: sqrt(2 + sqrt(2 + ...)) = 1 + 1 = 2; n = 2, a(2) = 6: sqrt(6 + sqrt(6 + ...)) = 1 + 2 = 3. - Wolfdieter Lang, May 05 2006

Nonsquare integers m divisible by ceiling(sqrt(m)), except for m = 0. - Max Alekseyev, Nov 27 2006

The number of off-diagonal elements of an (n + 1) X (n + 1) matrix. - Artur Jasinski, Jan 11 2007

a(n) is equal to the number of functions f:{1, 2} -> {1, 2, ..., n + 1} such that for a fixed x in {1, 2} and a fixed y in {1, 2, ..., n + 1} we have f(x) <> y. - Aleksandar M. Janjic and Milan Janjic, Mar 13 2007

Numbers m >= 0 such that round(sqrt(m+1)) - round(sqrt(m)) = 1. - Hieronymus Fischer, Aug 06 2007

Numbers m >= 0 such that ceiling(2*sqrt(m+1)) - 1 = 1 + floor(2*sqrt(m)). - Hieronymus Fischer, Aug 06 2007

Numbers m >= 0 such that fract(sqrt(m+1)) > 1/2 and fract(sqrt(m)) < 1/2 where fract(x) is the fractional part (fract(x) = x - floor(x), x >= 0). - Hieronymus Fischer, Aug 06 2007

X values of solutions to the equation 4*X^3 + X^2 = Y^2. To find Y values: b(n) = n(n+1)(2n+1). - Mohamed Bouhamida, Nov 06 2007

Nonvanishing diagonal of A132792, the infinitesimal Lah matrix, so "generalized factorials" composed of a(n) are given by the elements of the Lah matrix, unsigned A111596, e.g., a(1)*a(2)*a(3) / 3! = -A111596(4,1) = 24. - Tom Copeland, Nov 20 2007

If Y is a 2-subset of an n-set X then, for n >= 2, a(n-2) is the number of 2-subsets and 3-subsets of X having exactly one element in common with Y. - Milan Janjic, Dec 28 2007

a(n) coincides with the vertex of a parabola of even width in the Redheffer matrix, directed toward zero. An integer p is prime if and only if for all integer k, the parabola y = kx - x^2 has no integer solution with 1 < x < k when y = p; a(n) corresponds to odd k. - Reikku Kulon, Nov 30 2008

The third differences of certain values of the hypergeometric function 3F2 lead to the squares of the oblong numbers i.e., 3F2([1, n + 1, n + 1], [n + 2, n + 2], z = 1) - 3*3F2([1, n + 2, n + 2], [n + 3, n + 3], z = 1) + 3*3F2([1, n + 3, n + 3], [n + 4, n + 4], z = 1) - 3F2([1, n + 4, n + 4], [n + 5, n + 5], z = 1) = (1/((n+2)*(n+3)))^2 for n = -1, 0, 1, 2, ... . See also A162990. - Johannes W. Meijer, Jul 21 2009

Generalized factorials, [a.(n!)] = a(n)*a(n-1)*...*a(0) = A010790(n), with a(0) = 1 are related to A001263. - Tom Copeland, Sep 21 2011

For n > 1, a(n) is the number of functions f:{1, 2} -> {1, ..., n + 2} where f(1) > 1 and f(2) > 2. Note that there are n + 1 possible values for f(1) and n possible values for f(2). For example, a(3) = 12 since there are 12 functions f from {1, 2} to {1, 2, 3, 4, 5} with f(1) > 1 and f(2) > 2. - Dennis P. Walsh, Dec 24 2011

a(n) gives the number of (n + 1) X (n + 1) symmetric (0, 1)-matrices containing two ones (see [Cameron]). - L. Edson Jeffery, Feb 18 2012

a(n) is the number of positions of a domino in a rectangled triangular board with both legs equal to n + 1. - César Eliud Lozada, Sep 26 2012

a(n) is the number of ordered pairs (x, y) in [n+2] X [n+2] with |x-y| > 1. - Dennis P. Walsh, Nov 27 2012

a(n) is the number of injective functions from {1, 2} into {1, 2, ..., n + 1}. - Dennis P. Walsh, Nov 27 2012

a(n) is the sum of the positive differences of the partition parts of 2n + 2 into exactly two parts (see example). - Wesley Ivan Hurt, Jun 02 2013

a(n)/a(n-1) is asymptotic to e^(2/n). - Richard R. Forberg, Jun 22 2013

Number of positive roots in the root system of type D_{n + 1} (for n > 2). - Tom Edgar, Nov 05 2013

Number of roots in the root system of type A_n (for n > 0). - Tom Edgar, Nov 05 2013

From Felix P. Muga II, Mar 18 2014: (Start)

a(m), for m >= 1, are the only positive integer values t for which the Binet-de Moivre formula for the recurrence b(n) = b(n-1) + t*b(n-2) with b(0) = 0 and b(1) = 1 has a root of a square. PROOF (as suggested by Wolfdieter Lang, Mar 26 2014): The sqrt(1 + 4t) appearing in the zeros r1 and r2 of the characteristic equation is (a positive) integer for positive integer t precisely if 4t + 1 = (2m + 1)^2, that is t = a(m), m >= 1. Thus, the characteristic roots are integers: r1 = m + 1 and r2 = -m.

Let m > 1 be an integer. If b(n) = b(n-1) + a(m)*b(n-2), n >= 2, b(0) = 0, b(1) = 1, then lim_{n->oo} b(n+1)/b(n) = m + 1. (End)

Cf. A130534 for relations to colored forests, disposition of flags on flagpoles, and colorings of the vertices (chromatic polynomial) of the complete graphs (here simply K_2). - Tom Copeland, Apr 05 2014

The set of integers k for which k + sqrt(k + sqrt(k + sqrt(k + sqrt(k + ...) ... is an integer. - Leslie Koller, Apr 11 2014

a(n-1) is the largest number k such that (n*k)/(n+k) is an integer. - Derek Orr, May 22 2014

Number of ways to place a domino and a singleton on a strip of length n - 2. - Ralf Stephan, Jun 09 2014

With offset 1, this appears to give the maximal number of crossings between n nonconcentric circles of equal radius. - Felix Fröhlich, Jul 14 2014

For n > 1, the harmonic mean of the n values a(1) to a(n) is n + 1. The lowest infinite sequence of increasing positive integers whose cumulative harmonic mean is integral. - Ian Duff, Feb 01 2015

a(n) is the maximum number of queens of one color that can coexist without attacking one queen of the opponent's color on an (n+2) X (n+2) chessboard. The lone queen can be placed in any position on the perimeter of the board. - Bob Selcoe, Feb 07 2015

With a(0) = 1, a(n-1) is the smallest positive number not in the sequence such that Sum_{i = 1..n} 1/a(i-1) has a denominator equal to n. - Derek Orr, Jun 17 2015

The positive members of this sequence are a proper subsequence of the so-called 1-happy couple products A007969. See the W. Lang link there, eq. (4), with Y_0 = 1, with a table at the end. - Wolfdieter Lang, Sep 19 2015

For n > 0, a(n) is the reciprocal of the area bounded above by y = x^(n-1) and below by y = x^n for x in the interval [0, 1]. Summing all such areas visually demonstrates the formula below giving Sum_{n >= 1} 1/a(n) = 1. - Rick L. Shepherd, Oct 26 2015

It appears that, except for a(0) = 0, this is the set of positive integers n such that x*floor(x) = n has no solution. (For example, to get 3, take x = -3/2.) - Melvin Peralta, Apr 14 2016

If two independent real random variables, x and y, are distributed according to the same exponential distribution: pdf(x) = lambda * exp(-lambda * x), lambda > 0, then the probability that n - 1 <= x/y < n is given by 1/a(n). - Andres Cicuttin, Dec 03 2016

a(n) is equal to the sum of all possible differences between n different pairs of consecutive odd numbers (see example). - Miquel Cerda, Dec 04 2016

a(n+1) is the dimension of the space of vector fields in the plane with polynomial coefficients up to order n. - Martin Licht, Dec 04 2016

It appears that a(n) + 3 is the area of the largest possible pond in a square (A268311). - Craig Knecht, May 04 2017

Also the number of 3-cycles in the (n+3)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017

Also the Wiener index of the (n+2)-wheel graph. - Eric W. Weisstein, Sep 08 2017

The left edge of a Floyd's triangle that consists of even numbers: 0; 2, 4; 6, 8, 10; 12, 14, 16, 18; 20, 22, 24, 26, 28; ... giving 0, 2, 6, 12, 20, ... The right edge generates A028552. - Waldemar Puszkarz, Feb 02 2018

a(n+1) is the order of rowmotion on a poset obtained by adjoining a unique minimal (or maximal) element to a disjoint union of at least two chains of n elements. - Nick Mayers, Jun 01 2018

From Juhani Heino, Feb 05 2019: (Start)

For n > 0, 1/a(n) = n/(n+1) - (n-1)/n.

For example, 1/6 = 2/3 - 1/2; 1/12 = 3/4 - 2/3.

Corollary of this:

Take 1/2 pill.

Next day, take 1/6 pill. 1/2 + 1/6 = 2/3, so your daily average is 1/3.

Next day, take 1/12 pill. 2/3 + 1/12 = 3/4, so your daily average is 1/4.

And so on. (End)

From Bernard Schott, May 22 2020: (Start)

For an oblong number m >= 6 there exists a Euclidean division m = d*q + r with q < r < d which are in geometric progression, in this order, with a common integer ratio b. For b >= 2 and q >= 1, the Euclidean division is m = qb*(qb+1) = qb^2 * q + qb where (q, qb, qb^2) are in geometric progression.

Some examples with distinct ratios and quotients:

6 | 4 30 | 25 42 | 18

----- ----- -----

2 | 1 , 5 | 1 , 6 | 2 ,

and also:

42 | 12 420 | 100

----- -----

6 | 3 , 20 | 4 .

Some oblong numbers also satisfy a Euclidean division m = d*q + r with q < r < d that are in geometric progression in this order but with a common noninteger ratio b > 1 (see A335064). (End)

For n >= 1, the continued fraction expansion of sqrt(a(n)) is [n; {2, 2n}]. For n=1, this collapses to [1; {2}]. - Magus K. Chu, Sep 09 2022

a(n-2) is the maximum irregularity over all trees with n vertices. The extremal graphs are stars. (The irregularity of a graph is the sum of the differences between the degrees over all edges of the graph.) - Allan Bickle, May 29 2023

For n > 0, number of diagonals in a regular 2*(n+1)-gon that are not parallel to any edge (cf. A367204). - Paolo Xausa, Mar 30 2024

a(n-1) is the maximum Zagreb index over all trees with n vertices. The extremal graphs are stars. (The Zagreb index of a graph is the sum of the squares of the degrees over all vertices of the graph.) - Allan Bickle, Apr 11 2024

For n >= 1, a(n) is the determinant of the distance matrix of a cycle graph on 2*n + 1 vertices (if the length of the cycle is even such a determinant is zero). - Miquel A. Fiol, Aug 20 2024

For n > 1, the continued fraction expansion of sqrt(16*a(n)) is [2n+1; {1, 2n-1, 1, 8n+2}]. - Magus K. Chu, Nov 20 2024

For n>=2, a(n) is the number of faces on a n+1-zone rhombic zonohedron. Each pair of a collection of great circles on a sphere intersects at two points, so there are 2*binomial(n+1,2) intersections. The dual of the implied polyhedron is a rhombic zonohedron, its faces corresponding to the intersections. - Shel Kaphan, Aug 12 2025

The sequence contains exactly one square greater than 1, namely 4900 (according to Gardner). - Jud McCranie, Mar 19 2001, Mar 22 2007 [This is a result from Watson. - Charles R Greathouse IV, Jun 21 2013] [See A351830 for further related comments and references.]

Number of rhombi in an n X n rhombus. - Matti De Craene (Matti.DeCraene(AT)rug.ac.be), May 14 2000

Number of acute triangles made from the vertices of a regular n-polygon when n is odd (cf. A007290). - Sen-Peng Eu, Apr 05 2001

Gives number of squares with sides parallel to the axes formed from an n X n square. In a 1 X 1 square, one is formed. In a 2 X 2 square, five squares are formed. In a 3 X 3 square, 14 squares are formed and so on. - Kristie Smith (kristie10spud(AT)hotmail.com), Apr 16 2002; edited by Eric W. Weisstein, Mar 05 2025

a(n-1) = B_3(n)/3, where B_3(x) = x(x-1)(x-1/2) is the third Bernoulli polynomial. - Michael Somos, Mar 13 2004

Number of permutations avoiding 13-2 that contain the pattern 32-1 exactly once.

Since 3*r = (r+1) + r + (r-1) = T(r+1) - T(r-2), where T(r) = r-th triangular number r*(r+1)/2, we have 3*r^2 = r*(T(r+1) - T(r-2)) = f(r+1) - f(r-1) ... (i), where f(r) = (r-1)*T(r) = (r+1)*T(r-1). Summing over n, the right hand side of relation (i) telescopes to f(n+1) + f(n) = T(n)*((n+2) + (n-1)), whence the result Sum_{r=1..n} r^2 = n*(n+1)*(2*n+1)/6 immediately follows. - Lekraj Beedassy, Aug 06 2004

Also as a(n) = (1/6)*(2*n^3 + 3*n^2 + n), n > 0: structured trigonal diamond numbers (vertex structure 5) (cf. A006003 = alternate vertex; A000447 = structured diamonds; A100145 for more on structured numbers). - James A. Record (james.record(AT)gmail.com), Nov 07 2004

Number of triples of integers from {1, 2, ..., n} whose last component is greater than or equal to the others.

Kekulé numbers for certain benzenoids. - Emeric Deutsch, Jun 12 2005

Sum of the first n positive squares. - Cino Hilliard, Jun 18 2007

Maximal number of cubes of side 1 in a right pyramid with a square base of side n and height n. - Pasquale CUTOLO (p.cutolo(AT)inwind.it), Jul 09 2007

If a 2-set Y and an (n-2)-set Z are disjoint subsets of an n-set X then a(n-3) is the number of 4-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 19 2007

We also have the identity 1 + (1+4) + (1+4+9) + ... + (1+4+9+16+ ... + n^2) = n(n+1)(n+2)(n+(n+1)+(n+2))/36; ... and in general the k-fold nested sum of squares can be expressed as n(n+1)...(n+k)(n+(n+1)+...+(n+k))/((k+2)!(k+1)/2). - Alexander R. Povolotsky, Nov 21 2007

The terms of this sequence are coefficients of the Engel expansion of the following converging sum: 1/(1^2) + (1/1^2)*(1/(1^2+2^2)) + (1/1^2)*(1/(1^2+2^2))*(1/(1^2+2^2+3^2)) + ... - Alexander R. Povolotsky, Dec 10 2007

Convolution of A000290 with A000012. - Sergio Falcon, Feb 05 2008

Hankel transform of binomial(2*n-3, n-1) is -a(n). - Paul Barry, Feb 12 2008

Starting (1, 5, 14, 30, ...) = binomial transform of [1, 4, 5, 2, 0, 0, 0, ...]. - Gary W. Adamson, Jun 13 2008

Starting (1,5,14,30,...) = second partial sums of binomial transform of [1,2,0,0,0,...]. a(n) = Sum_{i=0..n} binomial(n+2,i+2)*b(i), where b(i)=1,2,0,0,0,... - Borislav St. Borisov (b.st.borisov(AT)abv.bg), Mar 05 2009

Convolution of A001477 with A005408: a(n) = Sum_{k=0..n} (2*k+1)*(n-k). - Reinhard Zumkeller, Mar 07 2009

Sequence of the absolute values of the z^1 coefficients of the polynomials in the GF1 denominators of A156921. See A157702 for background information. - Johannes W. Meijer, Mar 07 2009

The sequence is related to A000217 by a(n) = n*A000217(n) - Sum_{i=0..n-1} A000217(i) and this is the case d = 1 in the identity n^2*(d*n-d+2)/2 - Sum_{i=0..n-1} i*(d*i-d+2)/2 = n*(n+1)(2*d*n-2*d+3)/6, or also the case d = 0 in n^2*(n+2*d+1)/2 - Sum_{i=0..n-1} i*(i+2*d+1)/2 = n*(n+1)*(2*n+3*d+1)/6. - Bruno Berselli, Apr 21 2010, Apr 03 2012

a(n)/n = k^2 (k = integer) for n = 337; a(337) = 12814425, a(n)/n = 38025, k = 195, i.e., the number k = 195 is the quadratic mean (root mean square) of the first 337 positive integers. There are other such numbers -- see A084231 and A084232. - Jaroslav Krizek, May 23 2010

Also the number of moves to solve the "alternate coins game": given 2n+1 coins (n+1 Black, n White) set alternately in a row (BWBW...BWB) translate (not rotate) a pair of adjacent coins at a time (1 B and 1 W) so that at the end the arrangement shall be BBBBB..BW...WWWWW (Blacks separated by Whites). Isolated coins cannot be moved. - Carmine Suriano, Sep 10 2010

From J. M. Bergot, Aug 23 2011: (Start)

Using four consecutive numbers n, n+1, n+2, and n+3 take all possible pairs (n, n+1), (n, n+2), (n, n+3), (n+1, n+2), (n+1, n+3), (n+2, n+3) to create unreduced Pythagorean triangles. The sum of all six areas is 60*a(n+1).

Using three consecutive odd numbers j, k, m, (j+k+m)^3 - (j^3 + k^3 + m^3) equals 576*a(n) = 24^2*a(n) where n = (j+1)/2. (End)

From Ant King, Oct 17 2012: (Start)

For n > 0, the digital roots of this sequence A010888(a(n)) form the purely periodic 27-cycle {1, 5, 5, 3, 1, 1, 5, 6, 6, 7, 2, 2, 9, 7, 7, 2, 3, 3, 4, 8, 8, 6, 4, 4, 8, 9, 9}.

For n > 0, the units' digits of this sequence A010879(a(n)) form the purely periodic 20-cycle {1, 5, 4, 0, 5, 1, 0, 4, 5, 5, 6, 0, 9, 5, 0, 6, 5, 9, 0, 0}. (End)

Length of the Pisano period of this sequence mod n, n>=1: 1, 4, 9, 8, 5, 36, 7, 16, 27, 20, 11, 72, 13, 28, 45, 32, 17, 108, 19, 40, ... . - R. J. Mathar, Oct 17 2012

Sum of entries of n X n square matrix with elements min(i,j). - Enrique Pérez Herrero, Jan 16 2013

The number of intersections of diagonals in the interior of regular n-gon for odd n > 1 divided by n is a square pyramidal number; that is, A006561(2*n+1)/(2*n+1) = A000330(n-1) = (1/6)*n*(n-1)*(2*n-1). - Martin Renner, Mar 06 2013

For n > 1, a(n)/(2n+1) = A024702(m), for n such that 2n+1 = prime, which results in 2n+1 = A000040(m). For example, for n = 8, 2n+1 = 17 = A000040(7), a(8) = 204, 204/17 = 12 = A024702(7). - Richard R. Forberg, Aug 20 2013

A formula for the r-th successive summation of k^2, for k = 1 to n, is (2*n+r)*(n+r)!/((r+2)!*(n-1)!) (H. W. Gould). - Gary Detlefs, Jan 02 2014

The n-th square pyramidal number = the n-th triangular dipyramidal number (Johnson 12), which is the sum of the n-th + (n-1)-st tetrahedral numbers. E.g., the 3rd tetrahedral number is 10 = 1+3+6, the 2nd is 4 = 1+3. In triangular "dipyramidal form" these numbers can be written as 1+3+6+3+1 = 14. For "square pyramidal form", rebracket as 1+(1+3)+(3+6) = 14. - John F. Richardson, Mar 27 2014

Beukers and Top prove that no square pyramidal number > 1 equals a tetrahedral number A000292. - Jonathan Sondow, Jun 21 2014

Odd numbered entries are related to dissections of polygons through A100157. - Tom Copeland, Oct 05 2014

From Bui Quang Tuan, Apr 03 2015: (Start)

We construct a number triangle from the integers 1, 2, 3, ..., n as follows. The first column contains 2*n-1 integers 1. The second column contains 2*n-3 integers 2, ... The last column contains only one integer n. The sum of all the numbers in the triangle is a(n).

Here is an example with n = 5:

1

1 2

1 2 3

1 2 3 4

1 2 3 4 5

1 2 3 4

1 2 3

1 2

1

(End)

The Catalan number series A000108(n+3), offset 0, gives Hankel transform revealing the square pyramidal numbers starting at 5, A000330(n+2), offset 0 (empirical observation). - Tony Foster III, Sep 05 2016; see Dougherty et al. link p. 2. - Andrey Zabolotskiy, Oct 13 2016

Number of floating point additions in the factorization of an (n+1) X (n+1) real matrix by Gaussian elimination as e.g. implemented in LINPACK subroutines sgefa.f or dgefa.f. The number of multiplications is given by A007290. - Hugo Pfoertner, Mar 28 2018

The Jacobi polynomial P(n-1,-n+2,2,3) or equivalently the sum of dot products of vectors from the first n rows of Pascal's triangle (A007318) with the up-diagonal Chebyshev T coefficient vector (1,3,2,0,...) (A053120) or down-diagonal vector (1,-7,32,-120,400,...) (A001794). a(5) = 1 + (1,1).(1,3) + (1,2,1).(1,3,2) + (1,3,3,1).(1,3,2,0) + (1,4,6,4,1).(1,3,2,0,0) = (1 + (1,1).(1,-7) + (1,2,1).(1,-7,32) + (1,3,3,1).(1,-7,32,-120) + (1,4,6,4,1).(1,-7,32,-120,400))*(-1)^(n-1) = 55. - Richard Turk, Jul 03 2018

Coefficients in the terminating series identity 1 - 5*n/(n + 4) + 14*n*(n - 1)/((n + 4)*(n + 5)) - 30*n*(n - 1)*(n - 2)/((n + 4)*(n + 5)*(n + 6)) + ... = 0 for n = 1,2,3,.... Cf. A002415 and A108674. - Peter Bala, Feb 12 2019

n divides a(n) iff n == +- 1 (mod 6) (see A007310). (See De Koninck reference.) Examples: a(11) = 506 = 11 * 46, and a(13) = 819 = 13 * 63. - Bernard Schott, Jan 10 2020

For n > 0, a(n) is the number of ternary words of length n+2 having 3 letters equal to 2 and 0 only occurring as the last letter. For example, for n=2, the length 4 words are 2221,2212,2122,1222,2220. - Milan Janjic, Jan 28 2020

Conjecture: Every integer can be represented as a sum of three generalized square pyramidal numbers. A related conjecture is given in A336205 corresponding to pentagonal case. A stronger version of these conjectures is that every integer can be expressed as a sum of three generalized r-gonal pyramidal numbers for all r >= 3. In here "generalized" means negative indices are included. - Altug Alkan, Jul 30 2020

The natural number y is a term if and only if y = a(floor((3 * y)^(1/3))). - Robert Israel, Dec 04 2024

Also the number of directed bishop moves on an n X n chessboard, where two moves are considered the same if one can be obtained from the other by a rotation of the board. Reflections are ignored. Equivalently, number of directed bishop moves on an n X n chessboard, where two moves are considered the same if one can be obtained from the other by an axial reflection of the board (horizontal or vertical). Rotations and diagonal reflections are ignored. - Hilko Koning, Aug 22 2025

Figurate numbers based on 4-dimensional regular convex polytope called the 4-measure polytope, 4-hypercube or tesseract with Schlaefli symbol {4,3,3}. - Michael J. Welch (mjw1(AT)ntlworld.com), Apr 01 2004

Totally multiplicative sequence with a(p) = p^4 for prime p. - Jaroslav Krizek, Nov 01 2009

The binomial transform yields A058649. The inverse binomial transforms yields the (finite) 0, 1, 14, 36, 24, the 4th row in A019538 and A131689. - R. J. Mathar, Jan 16 2013

Generate Pythagorean triangles with parameters a and b to get sides of lengths x = b^2-a^2, y = 2*a*b, and z = a^2 + b^2. In particular use a=n-1 and b=n for a triangle with sides (x1,y1,z1) and a=n and b=n+1 for another triangle with sides (x2,y2,z2). Then x1*x2 + y1*y2 + z1*z2 = 8*a(n). - J. M. Bergot, Jul 22 2013

For n > 0, a(n) is the largest integer k such that k^4 + n is a multiple of k + n. Also, for n > 0, a(n) is the largest integer k such that k^2 + n^2 is a multiple of k + n^2. - Derek Orr, Sep 04 2014

Does not satisfy Benford's law [Ross, 2012]. - N. J. A. Sloane, Feb 08 2017

a(n+2)/2 is the area of a trapezoid with vertices at (T(n), T(n+1)), (T(n+1), T(n)), (T(n+1), T(n+2)), and (T(n+2), T(n+1)) with T(n)=A000292(n) for n >= 0. - J. M. Bergot, Feb 16 2018

Number of antichains (or order ideals) in the poset 2*(k-1)*(n-k) or plane partitions with rows <= k-1, columns <= n-k and entries <= 2. - Mitch Harris, Jul 15 2000

T(n,k) is the number of Dyck n-paths with exactly k peaks. a(n,k) = number of pairs (P,Q) of lattice paths from (0,0) to (k,n+1-k), each consisting of unit steps East or North, such that P lies strictly above Q except at the endpoints. - David Callan, Mar 23 2004

Number of permutations of [n] which avoid-132 and have k-1 descents. - Mike Zabrocki, Aug 26 2004

T(n,k) is the number of paths through n panes of glass, entering and leaving from one side, of length 2n with k reflections (where traversing one pane of glass is the unit length). - Mitch Harris, Jul 06 2006

Antidiagonal sums given by A004148 (without first term).

T(n,k) is the number of full binary trees with n internal nodes and k-1 jumps. In the preorder traversal of a full binary tree, any transition from a node at a deeper level to a node on a strictly higher level is called a jump. - Emeric Deutsch, Jan 18 2007

From Gary W. Adamson, Oct 22 2007: (Start)

The n-th row can be generated by the following operation using an ascending row of (n-1) triangular terms, (A) and a descending row, (B); e.g., row 6:

A: 1....3....6....10....15

B: 15...10....6.....3.....1

C: 1...15...50....50....15....1 = row 6.

Leftmost column of A,B -> first two terms of C; then followed by the operation B*C/A of current column = next term of row C, (e.g., 10*15/3 = 50). Continuing with the operation, we get row 6: (1, 15, 50, 50, 15, 1). (End)

The previous comment can be upgraded to: The ConvOffsStoT transform of the triangular series; and by rows, row 6 is the ConvOffs transform of (1, 3, 6, 10, 15). Refer to triangle A117401 as another example of the ConvOffsStoT transform, and OEIS under Maple Transforms. - Gary W. Adamson, Jul 09 2012

For a connection to Lagrange inversion, see A134264. - Tom Copeland, Aug 15 2008

T(n,k) is also the number of order-decreasing and order-preserving mappings (of an n-element set) of height k (height of a mapping is the cardinal of its image set). - Abdullahi Umar, Aug 21 2008

Row n of this triangle is the h-vector of the simplicial complex dual to an associahedron of type A_n [Fomin & Reading, p.60]. See A033282 for the corresponding array of f-vectors for associahedra of type A_n. See A008459 and A145903 for the h-vectors for associahedra of type B and type D respectively. The Hilbert transform of this triangle (see A145905 for the definition of this transform) is A145904. - Peter Bala, Oct 27 2008

T(n,k) is also the number of noncrossing set partitions of [n] into k blocks. Given a partition P of the set {1,2,...,n}, a crossing in P are four integers [a, b, c, d] with 1 <= a < b < c < d <= n for which a, c are together in a block, and b, d are together in a different block. A noncrossing partition is a partition with no crossings. - Peter Luschny, Apr 29 2011

Noncrossing set partitions are also called genus 0 partitions. In terms of genus-dependent Stirling numbers of the second kind S2(n,k,g) that count partitions of genus g of an n-set into k nonempty subsets, one has T(n,k) = S2(n,k,0). - Robert Coquereaux, Feb 15 2024

Diagonals of A089732 are rows of A001263. - Tom Copeland, May 14 2012

From Peter Bala, Aug 07 2013: (Start)

Let E(y) = Sum_{n >= 0} y^n/(n!*(n+1)!) = 1/sqrt(y)*BesselI(1,2*sqrt(y)). Then this triangle is the generalized Riordan array (E(y), y) with respect to the sequence n!*(n+1)! as defined in Wang and Wang.

Generating function E(y)*E(x*y) = 1 + (1 + x)*y/(1!*2!) + (1 + 3*x + x^2)*y^2/(2!*3!) + (1 + 6*x + 6*x^2 + x^3)*y^3/(3!*4!) + .... Cf. A105278 with a generating function exp(y)*E(x*y).

The n-th power of this array has a generating function E(y)^n*E(x*y). In particular, the matrix inverse A103364 has a generating function E(x*y)/E(y). (End)

T(n,k) is the number of nonintersecting n arches above the x axis, starting and ending on vertices 1 to 2n, with k being the number of arches starting on an odd vertice and ending on a higher even vertice. Example: T(3,2)=3 [16,25,34] [14,23,56] [12,36,45]. - Roger Ford, Jun 14 2014

Fomin and Reading on p. 31 state that the rows of the Narayana matrix are the h-vectors of the associahedra as well as its dual. - Tom Copeland, Jun 27 2017

The row polynomials P(n, x) = Sum_{k=1..n} T(n, k)*x^(k-1), together with P(0, x) = 1, multiplied by (n+1) are the numerator polynomials of the o.g.f.s of the diagonal sequences of the triangle A103371: G(n, x) = (n+1)*P(n, x)/(1 - x)^{2*n+1}, for n >= 0. This is proved with Lagrange's theorem applied to the Riordan triangle A135278 = (1/(1 - x)^2, x/(1 - x)). See an example below. - Wolfdieter Lang, Jul 31 2017

T(n,k) is the number of Dyck paths of semilength n with k-1 uu-blocks (pairs of consecutive up-steps). - Alexander Burstein, Jun 22 2020

In case you were searching for Narayama numbers, the correct spelling is Narayana. - N. J. A. Sloane, Nov 11 2020

Named after the Canadian mathematician Tadepalli Venkata Narayana (1930-1987). They were also called "Runyon numbers" after John P. Runyon (1922-2013) of Bell Telephone Laboratories, who used them in a study of a telephone traffic system. - Amiram Eldar, Apr 15 2021 The Narayana numbers were first studied by Percy Alexander MacMahon (see reference, Article 495) as pointed out by Bóna and Sagan (see link). - Peter Luschny, Apr 28 2022

From Andrea Arlette España, Nov 14 2022: (Start)

T(n,k) is the degree distribution of the paths towards synchronization in the transition diagram associated with the Laplacian system over the complete graph K_n, corresponding to ordered initial conditions x_1 < x_2 < ... < x_n.

T(n,k) for n=2N+1 and k=N+1 is the number of states in the transition diagram associated with the Laplacian system over the complete bipartite graph K_{N,N}, corresponding to ordered (x_1 < x_2 < ... < x_N and x_{N+1} < x_{N+2} < ... < x_{2N}) and balanced (Sum_{i=1..N} x_i/N = Sum_{i=N+1..2N} x_i/N) initial conditions. (End)

From Gus Wiseman, Jan 23 2023: (Start)

Also the number of unlabeled ordered rooted trees with n nodes and k leaves. See the link by Marko Riedel. For example, row n = 5 counts the following trees:

((((o)))) (((o))o) ((o)oo) (oooo)

(((o)o)) ((oo)o)

(((oo))) ((ooo))

((o)(o)) (o(o)o)

((o(o))) (o(oo))

(o((o))) (oo(o))

The unordered version is A055277. Leaves in standard ordered trees are counted by A358371. (End)

Row sums: A083329

Alternating row sums: 1,0,-1,-1,-1,-1,-1,-1,-1,-1,...

Antidiagonal sums: A000071 (-1+Fibonacci numbers)

col 1: A000012

col 2: A005408

col 3: A000290

col 4: A000330

col 5: A002415

col 6: A005585

col 7: A040977

col 8: A050486

col 9: A053347

col 10: A054333

col 11: A054334

col 12: A057788

col 2n-1 of A208510 is column n of A208508

col 2n of A208510 is column n of A208509.

...

GENERAL DISCUSSION:

A208510 typifies arrays generated by paired recurrence equations of the following form:

u(n,x)=a(n,x)*u(n-1,x)+b(n,x)*v(n-1,x)+c(n,x)

v(n,x)=d(n,x)*u(n-1,x)+e(n,x)*v(n-1,x)+f(n,x).

...

These first-order recurrences imply separate second-order recurrences. In order to show them, the six functions a(n,x),...,f(n,x) are abbreviated as a,b,c,d,e,f.

Then, starting with initial values u(1,x)=1 and u(2,x)=a+b+c: u(n,x) = (a+e)u(n-1,x) + (bd-ae)u(n-2,x) + bf-ce+c.

With initial values v(1,x)=1 and v(2,x)=d+e+f: v(n,x) = (a+e)v(n-1,x) + (bd-ae)v(n-2,x) + cd-af+f.

...

In the guide below, the last column codes certain sequences that occur in one of these ways: row, column, edge, row sum, alternating row sum. Coding:

A: 1,-1,1,-1,1,-1,1.... A033999

B: 1,2,4,8,16,32,64,... powers of 2

C: 1,1,1,1,1,1,1,1,.... A000012

D: 2,2,2,2,2,2,2,2,.... A007395

E: 2,4,6,8,10,12,14,... even numbers

F: 1,1,2,3,5,8,13,21,.. Fibonacci numbers

N: 1,2,3,4,5,6,7,8,.... A000027

O: 1,3,5,7,9,11,13,.... odd numbers

P: 1,3,9,27,81,243,.... powers of 3

S: 1,4,9,16,25,36,49,.. squares

T: 1,3,6,10,15,21,38,.. triangular numbers

Z: 1,0,0,0,0,0,0,0,0,.. A000007

*: (eventually) periodic alternating row sums

^: has a limiting row; i.e., the polynomials "approach" a power series

This coding includes indirect and repeated occurrences; e.g. F occurs thrice at A094441: in column 1 directly as Fibonacci numbers, in row sums as odd-indexed Fibonacci numbers, and in alternating row sums as signed Fibonacci numbers.

......... a....b....c....d....e....f....code

A034839 u 1....1....0....1....x....0....CCOT

A034867 v 1....1....0....1....x....0....CEN

A210221 u 1....1....0....1....2x...0....BBFF

A210596 v 1....1....0....1....2x...0....BBFF

A105070 v 1....2x...0....1....1....0....BN

A207605 u 1....1....0....1....x+1..0....BCFFN

A106195 v 1....1....0....1....x+1..0....BCFFN

A207606 u 1....1....0....x....x+1..0....DNT

A207607 v 1....1....0....x....x+1..0....DNT

A207608 u 1....1....0....2x...x+1..0....N

A207609 v 1....1....0....2x...x+1..0....C

A207610 u 1....1....0....1....x....1....CF

A207611 v 1....1....0....1....x....1....BCF

A207612 u 1....1....0....1....2x...1....BF

A207613 v 1....1....0....1....2x...1....BF

A207614 u 1....1....0....1....x+1..1....CN

A207615 v 1....1....0....1....x+1..1....CFN

A207616 u 1....1....0....x....1....1....CE

A207617 v 1....1....0....x....1....1....CNO

A029638 u 1....1....0....x....x....1....CDNO

A029635 v 1....1....0....x....x....1....CDNOZ

A207618 u 1....1....0....x....2x...1....N

A207619 v 1....1....0....x....2x...1....CFN

A207620 u 1....1....0....x....x+1..1....DET

A207621 v 1....1....0....x....x+1..1....DNO

A207622 u 1....1....0....2x...1....1....BT

A207623 v 1....1....0....2x...1....1....BN

A207624 u 1....1....0....2x...x....1....N

A102662 v 1....1....0....2x...x....1....CO

A207625 u 1....1....0....2x...x+1..1....T

A207626 v 1....1....0....2x...x+1..1....N

A207627 u 1....1....0....2x...2x...1....BN

A207628 v 1....1....0....2x...2x...1....BCE

A207629 u 1....1....0....x+1..1....1....CET

A207630 v 1....1....0....x+1..1....1....CO

A207631 u 1....1....0....x+1..x....1....DF

A207632 v 1....1....0....x+1..x....1....DEF

A207633 u 1....1....0....x+1..2x...1....F

A207634 v 1....1....0....x+1..2x...1....F

A207635 u 1....1....0....x+1..x+1..1....DN

A207636 v 1....1....0....x+1..x+1..1....CD

A160232 u 1....x....0....1....2x...0....BCFN

A208341 v 1....x....0....1....2x...0....BCFFN

A085478 u 1....x....0....1....x+1..0....CCOFT*

A078812 v 1....x....0....1....x+1..0....CEFN*

A208342 u 1....x....0....x....x....0....CCFNO

A208343 v 1....x....0....x....x....0....BBCDFZ

A208344 u 1....x....0....x....2x...0....CCFN

A208345 v 1....x....0....x....2x...0....CFZ

A094436 u 1....x....0....x....x+1..0....CFFN

A094437 v 1....x....0....x....x+1..0....CEFF

A117919 u 1....x....0....2x...1....0....BCNT

A135837 v 1....x....0....2x...1....0....BCET

A208328 u 1....x....0....2x...x....0....CCOP

A208329 v 1....x....0....2x...x....0....DPZ

A208330 u 1....x....0....2x...x+1..0....CNPT

A208331 v 1....x....0....2x...x+1..0....CN

A208332 u 1....x....0....2x...2x...0....CCE

A208333 v 1....x....0....2x...2x...0....DZ

A208334 u 1....x....0....x+1..1....0....CCNT

A208335 v 1....x....0....x+1..1....0....CCN*

A208336 u 1....x....0....x+1..x....0....CFNT*

A208337 v 1....x....0....x+1..x....0....ACFN*

A208338 u 1....x....0....x+1..2x...0....CNP

A208339 v 1....x....0....x+1..2x...0....BCNP

A202390 u 1....x....0....x+1..x+1..0....CFPTZ*

A208340 v 1....x....0....x+1..x+1..0....FNPZ*

A208508 u 1....x....0....1....1....1....CCES

A208509 v 1....x....0....1....1....1....BCO

A208510 u 1....x....0....1....x....1....CCCNOS*

A029653 v 1....x....0....1....x....1....BCDOSZ*

A208511 u 1....x....0....1....2x...1....BCFO

A208512 v 1....x....0....1....2x...1....BDFO

A208513 u 1....x....0....1....x+1..1....CCES*

A111125 v 1....x....0....1....x+1..1....COO*

A133567 u 1....x....0....x....1....1....CCOTT

A133084 v 1....x....0....x....1....1....BBCEN

A208514 u 1....x....0....x....x....1....CEFN

A208515 v 1....x....0....x....x....1....BCDFN

A208516 u 1....x....0....x....2x...1....CNN

A208517 v 1....x....0....x....2x...1....CCN

A208518 u 1....x....0....x....x+1..1....CFNT

A208519 v 1....x....0....x....x+1..1....NFFT

A208520 u 1....x....0....2x...1....1....BCTT

A208521 v 1....x....0....2x...1....1....BEN

A208522 u 1....x....0....2x...x....1....CCN

A208523 v 1....x....0....2x...x....1....CCO

A208524 u 1....x....0....2x...x+1..1....CT*

A208525 v 1....x....0....2x...x+1..1....ACNP*

A208526 u 1....x....0....2x...2x...1....CEN

A208527 v 1....x....0....2x...2x...1....CCE

A208606 u 1....x....0....x+1..1....1....CCS

A208607 v 1....x....0....x+1..1....1....CNO

A208608 u 1....x....0....x+1..x....1....CFOT

A208609 v 1....x....0....x+1..x....1....DEN*

A208610 u 1....x....0....x+1..2x...1....CO

A208611 v 1....x....0....x+1..2x...1....DE

A208612 u 1....x....0....x+1..x+1..1....CFNS

A208613 v 1....x....0....x+1..x+1..1....CFN*

A105070 u 1....2x...0....1....1....0....BN

A207536 u 1....2x...0....1....1....0....BCT

A208751 u 1....2x...0....1....x+1..0....CDPT

A208752 v 1....2x...0....1....x+1..0....CNP

A135837 u 1....2x...0....x....1....0....BCNT

A117919 v 1....2x...0....x....1....0....BCNT

A208755 u 1....2x...0....x....x....0....BCDEP

A208756 v 1....2x...0....x....x....0....BCCOZ

A208757 u 1....2x...0....x....2x...0....CDEP

A208758 v 1....2x...0....x....2x...0....CCEPZ

A208763 u 1....2x...0....2x...x....0....CDOP

A208764 v 1....2x...0....2x...x....0....CCCP

A208765 u 1....2x...0....2x...x+1..0....CE

A208766 v 1....2x...0....2x...x+1..0....CC

A208747 u 1....2x...0....2x...2x...0....CDE

A208748 v 1....2x...0....2x...2x...0....CCZ

A208749 u 1....2x...0....x+1..1....0....BCOPT

A208750 v 1....2x...0....x+1..1....0....BCNP*

A208759 u 1....2x...0....x+1..2x....0...CE

A208760 v 1....2x...0....x+1..2x....0...BCO

A208761 u 1....2x...0....x+1..x+1...0...BCCT*

A208762 v 1....2x...0....x+1..x+1...0...BNZ*

A208753 u 1....2x...0....1....1.....1...BCS

A208754 v 1....2x...0....1....1.....1...BO

A105045 u 1....2x...0....1....2x....1...BCCOS*

A208659 v 1....2x...0....1....2x....1...BDOSZ*

A208660 u 1....2x...0....1....x+1...1...CDS

A208904 v 1....2x...0....1....x+1...1...CNO

A208905 u 1....2x...0....x....1.....1...BCT

A208906 v 1....2x...0....x....1.....1...BNN

A208907 u 1....2x...0....x....x.....1...BCN

A208756 v 1....2x...0....x....x.....1...BCCE

A208755 u 1....2x...0....x....2x....1...CEN

A208910 v 1....2x...0....x....2x....1...CCE

A208911 u 1....2x...0....x....x+1...1...BCT

A208912 v 1....2x...0....x....x+1...1...BNT

A208913 u 1....2x...0....2x...1.....1...BCT

A208914 v 1....2x...0....2x...1.....1...BEN

A208915 u 1....2x...0....2x...x.....1...CE

A208916 v 1....2x...0....2x...x.....1...CCO

A208919 u 1....2x...0....2x...x+1...1...CT

A208920 v 1....2x...0....2x...x+1...1...N

A208917 u 1....2x...0....2x...2x....1...CEN

A208918 v 1....2x...0....2x...2x....1...CCNP

A208921 u 1....2x...0....x+1..1.....1...BC

A208922 v 1....2x...0....x+1..1.....1...BON

A208923 u 1....2x...0....x+1..x.....1...BCNO

A208908 v 1....2x...0....x+1..x.....1...BDN*

A208909 u 1....2x...0....x+1..2x....1...BN

A208930 v 1....2x...0....x+1..2x....1...DN

A208931 u 1....2x...0....x+1..x+1...1...BCOS

A208932 v 1....2x...0....x+1..x+1...1...BCO*

A207537 u 1....x+1..0....1....1.....0...BCO

A207538 v 1....x+1..0....1....1.....0...BCE

A122075 u 1....x+1..0....1....x.....0...CCFN*

A037027 v 1....x+1..0....1....x.....0...CCFN*

A209125 u 1....x+1..0....1....2x....0...BCFN*

A164975 v 1....x+1..0....1....2x....0...BF

A209126 u 1....x+1..0....x....x.....0...CDFO*

A209127 v 1....x+1..0....x....x.....0...DFOZ*

A209128 u 1....x+1..0....x....2x....0...CDE*

A209129 v 1....x+1..0....x....2x....0...DEZ

A102756 u 1....x+1..0....x....x+1...0...CFNP*

A209130 v 1....x+1..0....x....x+1...0...CCFNP*

A209131 u 1....x+1..0....2x...x.....0...CDEP*

A209132 v 1....x+1..0....2x...x.....0...CNPZ*

A209133 u 1....x+1..0....2x...2x....0...CDN

A209134 v 1....x+1..0....2x...2x....0...CCN*

A209135 u 1....x+1..0....2x...x+1...0...CN*

A209136 v 1....x+1..0....2x...x+1...0...CCS*

A209137 u 1....x+1..0....x+1..x.....0...CFFP*

A209138 v 1....x+1..0....x+1..x.....0...AFFP*

A209139 u 1....x+1..0....x+1..2x....0...CF*

A209140 v 1....x+1..0....x+1..2x....0...BF

A209141 u 1....x+1..0....x+1..x+1...0...BCF*

A209142 v 1....x+1..0....x+1..x+1...0...BFZ*

A209143 u 1....x+1..0....1....1.....1...CCE*

A209144 v 1....x+1..0....1....1.....1...COO*

A209145 u 1....x+1..0....1....x.....1...CCFN*

A122075 v 1....x+1..0....1....x.....1...CCFN*

A209146 u 1....x+1..0....1....2x....1...BCF*

A209147 v 1....x+1..0....1....2x....1...BF

A209148 u 1....x+1..0....1....x+1...1...CCO*

A209149 v 1....x+1..0....1....x+1...1...CDO*

A209150 u 1....x+1..0....x....1.....1...CCNT*

A208335 v 1....x+1..0....x....1.....1...CDNN*

A209151 u 1....x+1..0....x....x.....1...CFN*

A208337 v 1....x+1..0....x....x.....1...ACFN*

A209152 u 1....x+1..0....x....2x....1...CN*

A208339 v 1....x+1..0....x....x.....1...BCN

A209153 u 1....x+1..0....x....x+1...1...CFT*

A208340 v 1....x+1..0....x....x.....1...FNZ*

A209154 u 1....x+1..0....2x...1.....1...BCT*

A209157 v 1....x+1..0....2x...1.....1...BNN

A209158 u 1....x+1..0....2x...x.....1...CN*

A209159 v 1....x+1..0....2x...x.....1...CO*

A209160 u 1....x+1..0....2x...2x....1...CN*

A209161 v 1....x+1..0....2x...2x....1...CE

A209162 u 1....x+1..0....2x...x+1...1...CT*

A209163 v 1....x+1..0....2x...x+1...1...CO*

A209164 u 1....x+1..0....x+1..1.....1...CC*

A209165 v 1....x+1..0....x+1..1.....1...CCN

A209166 u 1....x+1..0....x+1..x.....1...CFF*

A209167 v 1....x+1..0....x+1..x.....1...FF*

A209168 u 1....x+1..0....x+1..2x....1...CF*

A209169 v 1....x+1..0....x+1..2x....1...CF

A209170 u 1....x+1..0....x+1..x+1...1...CF*

A209171 v 1....x+1..0....x+1..x+1...1...CF*

A053538 u x....1....0....1....1.....0...BBCCFN

A076791 v x....1....0....1....1.....0...BBCDF

A209172 u x....1....0....1....2x....0...BCCFF

A209413 v x....1....0....1....2x....0...BCCFF

A094441 u x....1....0....1....x+1...0...CFFFN

A094442 v x....1....0....1....x+1...0...CEFFF

A054142 u x....1....0....x....x+1...0...CCFOT*

A172431 v x....1....0....x....x+1...0...CEFN*

A008288 u x....1....0....2x...1.....0...CCOO*

A035607 v x....1....0....2x...1.....0...ACDE*

A209414 u x....1....0....2x...x+1...0...CCS

A112351 v x....1....0....2x...x+1...0...CON

A209415 u x....1....0....x+1..x.....0...CCTN

A209416 v x....1....0....x+1..x.....0...ACN*

A209417 u x....1....0....x+1..2x....0...CC

A209418 v x....1....0....x+1..2x....0...BBC

A209419 u x....1....0....x+1..x+1...0...CFTZ*

A209420 v x....1....0....x+1..x+1...0...FNZ*

A209421 u x....1....0....1....1.....1...CCN

A209422 v x....1....0....1....1.....1...CD

A209555 u x....1....0....1....x.....1...CNN

A209556 v x....1....0....1....x.....1...CNN

A209557 u x....1....0....1....2x....1...BCN

A209558 v x....1....0....1....2x....1...BN

A209559 u x....1....0....1....x+1...1...CN

A209560 v x....1....0....1....x+1...1...CN

A209561 u x....1....0....x....1.....1...CCNNT*

A209562 v x....1....0....x....1.....1...CDNNT*

A209563 u x....1....0....x....x.....1...CCFT^

A209564 v x....1....0....x....x.....1...CFN^

A209565 u x....1....0....x....2x....1...CC^

A209566 v x....1....0....x....2x....1...BC^

A209567 u x....1....0....x....x+1...1...CNT*

A209568 v x....1....0....x....x+1...1...NNS*

A209569 u x....1....0....2x...1.....1...CNO*

A209570 v x....1....0....2x...1.....1...DNN*

A209571 u x....1....0....2x...x.....1...CCS^

A209572 v x....1....0....2x...x.....1...CN^

A209573 u x....1....0....2x...x+1...1...CNS

A209574 v x....1....0....2x...x+1...1...NO

A209575 u x....1....0....2x...2x....1...CC

A209576 v x....1....0....2x...2x....1...C

A209577 u x....1....0....x+1..1.....1...CNNT

A209578 v x....1....0....x+1..1.....1...CNN

A209579 u x....1....0....x+1..x.....1...CNNT

A209580 v x....1....0....x+1..x.....1...NN*

A209581 u x....1....0....x+1..2x....1...CN

A209582 v x....1....0....x+1..2x....1...BN

A209583 u x....1....0....x+1..x+1...1...CT*

A209584 v x....1....0....x+1..x+1...1...CN*

A121462 u x....x....0....x....x+1...0...BCFFNZ

A208341 v x....x....0....x....x+1...0...BCFFN

A209687 u x....x....0....2x...x+1...0...BCNZ

A208339 v x....x....0....2x...x+1...0...BCN

A115241 u x....x....0....1....1.....1...CDNZ*

A209688 v x....x....0....1....1.....1...DDN*

A209689 u x....x....0....1....x.....1...FNZ^

A209690 v x....x....0....1....x.....1...FN^

A209691 u x....x....0....1....2x....1...BCZ^

A209692 v x....x....0....1....2x....1...BCC^

A209693 u x....x....0....1....x+1...1...NNZ*

A209694 v x....x....0....1....x+1...1...CN*

A209697 u x....x....0....x....x+1...1...BNZ

A209698 v x....x....0....x....x+1...1...BNT

A209699 u x....x....0....2x...1.....1...BNNZ

A209700 v x....x....0....2x...1.....1...BDN

A209701 u x....x....0....2x...x+1...1...NZ

A209702 v x....x....0....2x...x+1...1...N

A209703 u x....x....0....x+1..1.....1...FNTZ

A209704 v x....x....0....x+1..1.....1...FNNT

A209705 u x....x....0....x+1..x+1...1...BNZ*

A209706 v x....x....0....x+1..x+1...1...BCN*

A209695 u x....x+1..0....2x...x+1...0...ACN*

A209696 v x....x+1..0....2x...x+1...0...CDN*

A209830 u x....x+1..0....x+1..2x....0...ACF

A209831 v x....x+1..0....x+1..2x....0...BCF*

A209745 u x....x+1..0....x+1..x+1...0...ABF*

A209746 v x....x+1..0....x+1..x+1...0...BFZ*

A209747 u x....x+1..0....1....1.....1...ADE*

A209748 v x....x+1..0....1....1.....1...DEO

A209749 u x....x+1..0....1....x.....1...ANN*

A209750 v x....x+1..0....1....x.....1...CNO

A209751 u x....x+1..0....1....2x....1...ABN*

A209752 v x....x+1..0....1....2x....1...BN

A209753 u x....x+1..0....1....x+1...1...AN*

A209754 v x....x+1..0....1....x+1...1...NT*

A209755 u x....x+1..0....x....1.....1...AFN

A209756 v x....x+1..0....x....1.....1...FNO*

A209759 u x....x+1..0....x....2x....1...ACF^

A209760 v x....x+1..0....x....2x....1...CF^*

A209761 u x....x+1..0....x.....x+1..1...ABNS*

A209762 v x....x+1..0....x.....x+1..1...BNS*

A209763 u x....x+1..0....2x....1....1...ABN*

A209764 v x....x+1..0....2x....1....1...BNN

A209765 u x....x+1..0....2x....x....1...ACF^*

A209766 v x....x+1..0....2x....x....1...CF^

A209767 u x....x+1..0....2x....x+1..1...AN*

A209768 v x....x+1..0....2x....x+1..1...N*

A209769 u x....x+1..0....x+1...1....1...AF*

A209770 v x....x+1..0....x+1...1....1...FN

A209771 u x....x+1..0....x+1...x....1...ABN*

A209772 v x....x+1..0....x+1...x....1...BN*

A209773 u x....x+1..0....x+1...2x...1...AF

A209774 v x....x+1..0....x+1...2x...1...FN*

A209775 u x....x+1..0....x+1...x+1..1...AB*

A209776 v x....x+1..0....x+1...x+1..1...BC*

A210033 u 1....1....1....1.....x....1...BCN

A210034 v 1....1....1....1.....x....1...BCDFN

A210035 u 1....1....1....1.....2x...1...BBF

A210036 v 1....1....1....1.....2x...1...BBFF

A210037 u 1....1....1....1.....x+1..1...BCFFN

A210038 v 1....1....1....1.....x+1..1...BCFFN

A210039 u 1....1....1....x.....1....1...BCOT

A210040 v 1....1....1....x.....1....1...BCEN

A210042 u 1....1....1....x.....x....1...BCDEOT*

A124927 v 1....1....1....x.....x....1...BCDET*

A210041 u 1....1....1....x.....2x...1...BFO

A209758 v 1....1....1....x.....2x...1...BCFO

A210187 u 1....1....1....x.....x+1..1...DTF*

A210188 v 1....1....1....x.....x+1..1...DNF*

A210189 u 1....1....1....2x....1....1...BT

A210190 v 1....1....1....2x....1....1...BN

A210191 u 1....1....1....2x....x....1...CO*

A210192 v 1....1....1....2x....x....1...CCO*

A210193 u 1....1....1....2x....x+1..1...CPT

A210194 v 1....1....1....2x....x+1..1...CN

A210195 u 1....1....1....2x....2x...1...BOPT*

A210196 v 1....1....1....2x....2x...1...BCC*

A210197 u 1....1....1....x+1...1....1...BCOT

A210198 v 1....1....1....x+1...1....1...BCEN

A210199 u 1....1....1....x+1...x....1...DFT

A210200 v 1....1....1....x+1...x....1...DFO*

A210201 u 1....1....1....x+1...2x...1...BFP

A210202 v 1....1....1....x+1...2x...1...BF

A210203 u 1....1....1....x+1...x+1..1...BDOP

A210204 v 1....1....1....x+1...x+1..1...BCDN*

A210211 u x....1....1....1.....2x...1...BCFN

A210212 v x....1....1....1.....2x...1...BFN

A210213 u x....1....1....1.....x+1..1...CFFN

A210214 v x....1....1....1.....x+1..1...CFFO

A210215 u x....1....1....x.....x....1...BCDFT^

A210216 v x....1....1....x.....x....1...BCFO^

A210217 u x....1....1....x.....2x...1...CDF^

A210218 v x....1....1....x.....2x...1...BCF^

A210219 u x....1....1....x.....x+1..1...CNSTF*

A210220 v x....1....1....x.....x+1..1...FNNT*

A104698 u x....1....1....2x......1..1...CENS*

A210220 v x....1....1....2x....x+1..1...DNNT*

A210223 u x....1....1....2x....x....1...CD^

A210224 v x....1....1....2x....x....1...CO^

A210225 u x....1....1....2x....x+1..1...CNP

A210226 v x....1....1....2x....x+1..1...NOT

A210227 u x....1....1....2x....2x...1...CDP^

A210228 v x....1....1....2x....2x...1...C^

A210229 u x....1....1....x+1...1....1...CFNN

A210230 v x....1....1....x+1...1....1...CCN

A210231 u x....1....1....x+1...x....1...CNT

A210232 v x....1....1....x+1...x....1...NN*

A210233 u x....1....1....x+1...2x...1...CNP

A210234 v x....1....1....x+1...2x...1...BN

A210235 u x....1....1....x+1...x+1..1...CCFPT*

A210236 v x....1....1....x+1...x+1..1...CFN*

A124927 u x....x....1....1.....1....1...BCDEET*

A210042 v x....1....1....x+1...x+1..1...BDEOT*

A210216 u x....x....1....1.....x....1...BCFO^

A210215 v x....x....1....1.....x....1...BCDFT^

A210549 u x....x....1....1.....2x...1...BCF^

A210550 v x....x....1....1.....2x...1...BDF^

A172431 u x....x....1....1.....x+1..1...CEFN*

A210551 v x....x....1....1.....x+1..1...CFOT*

A210552 u x....x....1....x.....1....1...BBCFNO

A210553 v x....x....1....x.....1....1...BNNFB

A208341 u x....x....1....x.....x+1..1...BCFFN

A210554 v x....x....1....x.....x+1..1...BNFFT

A210555 u x....x....1....2x....1....1...BCNN

A210556 v x....x....1....2x....1....1...BENP

A210557 u x....x....1....2x....x+1..1...CNP

A210558 v x....x....1....2x....x+1..1...N

A210559 u x....x....1....x+1...1....1...CEF

A210560 v x....x....1....x+1...1....1...OFNS

A210561 u x....x....1....x+1...x....1...BCNP^

A210562 v x....x....1....x+1...x....1...BDP*^

A210563 u x....x....1....x+1...2x...1...CFP^

A210564 v x....x....1....x+1...2x...1...DF^

A013609 u x....x....1....x+1...x+1..1...BCEPT*

A209757 v x....x....1....x+1...x+1..1...BCOS*

A209819 u x....2x...1....x+1...x....1...CFN^

A209820 v x....2x...1....x+1...x....1...DF^

A209996 u x....2x...1....x+1...2x...1...CP^

A209998 v x....2x...1....x+1...2x...1...DP^

A209999 u x....x+1..1....1.....x+1..1...FN*

A210287 v x....x+1..1....1.....x+1..1...CFT*

A210565 u x....x+1..1....x.....1....1...FNT*

A210595 v x....x+1..1....x.....1....1...FNNT

A210598 u x....x+1..1....x+1...2x...1...FN*

A210599 v x....x+1..1....x+1...2x...1...FN

A210600 u x....x+1..1....x+1...x+1..1...BF*

A210601 v x....x+1..1....x+1...x+1..1...BF*

A210597 u 2x...1....1....x+1...1....1...BF

A210601 v 2x...1....1....x+1...1....1...BFN*

A210603 u 2x...1....1....x+1...x+1..1...BF

A210738 v 2x...1....1....x+1...x+1..1...CBF*

A210739 u 2x...x....1....x+1...x....1...CF^

A210740 v 2x...x....1....x+1...x....1...DF*^

A210741 u 2x...x....1....x+1...x+1..1...BCFO

A210742 v 2x...x....1....x+1...x+1..1...CFO*

A210743 u 2x...x+1..1....x+1...1....1...F

A210744 v 2x...x+1..1....x+1...1....1...FN

A210747 u 2x...x+1..1....x+1...x+1..1...FF

A210748 v 2x...x+1..1....x+1...x+1..1...CFF*

A210749 u x+1..1....1....x+1...2x...1...BCF

A210750 v x+1..1....1....x+1...2x...1...BF

A210751 u x+1..x....1....x+1...2x...1...FNT

A210752 v x+1..x....1....x+1...2x...1...FN

A210753 u x+1..x....1....x+1...x+1..1...BNZ*

A210754 v x+1..x....1....x+1...x+1..1...BCT*

A210755 u x+1..2x...1....x+1...x+1..1...N*

A210756 v x+1..2x...1....x+1...x+1..1...CT*

A210789 u 1....x....0....x+2...x-1..0...CFFN

A210790 v 1....x....0....x+2...x-1..0...CEFF

A210791 u 1....x....0....x-1...x+2..0...CFNP

A210792 v 1....x....0....x-1...x+2..0...CF

A210793 u 1....x+1..0....x+2...x-1..0...CFNP

A210794 v 1....x+1..0....x+2...x-1..0...FPP

A210795 u 1....x....1....x+2...x-1..0...FN

A210796 v 1....x....1....x+2...x-1..0...FO

A210797 u 1....x....0....x+2...x-1..1...CF

A210798 v 1....x....0....x+2...x-1..1...F

A210799 u 1....x+1..1....x+2...x-1..0...FN

A210800 v 1....x+1..1....x+2...x-1..0...F

A210801 u 1....x+1..1....x+2...x-1..1...FN

A210802 v 1....x+1..1....x+2...x-1..1...F

A210803 u 1....x....0....x-1...x+3..0...F*

A210804 v 1....x....0....x-1...x+3..0...F*

A210805 u 1....x....0....x+2...x-1.-1...CFFN

A210806 v 1....x....0....x+2...x-1.-1...FF

A210858 u 1....x....0....x+n...x....0...CFT*

A210859 v 1....x....0....x+n...x....0...FN*

A210860 u 1....x+1..0....x+n...x....0...F

A210861 v 1....x+1..0....x+n...x....0...F*

A210862 u 1....x....1....x+n-1.x....0...FN

A210863 v 1....x....1....x+n-1.x....0...FS

A210864 u 1....x....1....x+n...x....0...FN

A210865 v 1....x....1....x+n...x....0...FT

A210866 u 1....x....0....x+n...x...-x...CFT

A210867 v 1....x....0....x+n...x...-x...FN

A210868 u 1....x....0....x+1...x-1..0...BCFN

A210869 v 1....x....0....x+1...x-1..0...BBCFNZ

A210870 u 1....x....0....x+1...x-1..1...CFFN

A210871 v 1....x....0....x+1...x-1..1...CFF

A210872 u x....1...-1....x.....x....1...BDFZ^

A210873 v x....1...-1....x.....x....1...BCFN^

A210876 u x....1....1....x.....x....x...BCCF^

A210877 v x....1....1....x.....x....x...BDFNZ^

A210878 u x....2x...0....x+1...x....1...DFZ^

A210879 v x....2x...0....x+1...x....1...FC*^

Some of these triangles have irregular row lengths, making it difficult to retrieve individual rows/columns/diagonals without actually computing the recurrence. - Georg Fischer, Sep 04 2021

Each sequence in the following guide counts 4-tuples

(w,x,y,z) such that the indicated relation holds and the four numbers w,x,y,z are in {1,...,n}. The notation "m div" means that m divides every term of the sequence.

A211058 ... wx <= yz

A211787 ... wx <= 2yz

A211795 ... wx < 2yz

A211797 ... wx > 2yz

A211809 ... wx >= 2yz

A211812 ... wx <= 3yz

A211917 ... wx < 3yz

A211918 ... wx > 3yz

A211919 ... wx >= 3yz

A211920 ... 2wx < 3yz

A211921 ... 2wx <= 3yz

A211922 ... 2wx > 3yz

A211923 ... 2wx >= 3yz

A212019 ... wx = 2yz ..... 2 div

A212020 ... wx = 3yz ..... 2 div

A212021 ... 2wx = 3yz .... 2 div

A212047 ... wx = 4yz

A212048 ... 3wx = 4yz .... 2 div

A212049 ... wx = 5yz ..... 2 div

A212050 ... 2wx = 5yz .... 2 div

A212051 ... 3wx = 5yz .... 2 div

A212052 ... 4wx = 5yz .... 2 div

A209978 ... wx = yz + 1 .. 2 div

A212053 ... wx <= yz + 1

A212054 ... wx > yz + 1

A212055 ... wx <= yz + 2

A212056 ... wx > yz + 2

A197168 ... wx = yz + 2 .. 2 div

A061201 ... w = xyz

A212057 ... w < xyz

A212058 ... w >= xyz

A212059 ... w = xyz - 1

A212060 ... w = xyz - 2

A212061 ... wx = (yz)^2

A212062 ... w^2 = xyz

A212063 ... w^2 < xyz

A212064 ... w^2 >= xyz

A212065 ... w^2 <= xyz

A212066 ... w^2 > xyz

A212067 ... w^3 = xyz

A002623 ... w = 2x + y + z

A006918 ... w = 2x + 2y + z

A000601 ... w = x + 2y + 3z (except for initial 0's)

A212068 ... 2w = x + y + z

A212069 ... 3w = x + y + z (w = average{x,y,z})

A212088 ... 3w < x + y + z

A212089 ... 3w >= x + y + z

A212090 ... w < x + y + z

A000332 ... w >= x + y + z

A212145 ... w < 2x + y + z

A001752 ... w >= 2x + y + z

A001400 ... w = 2x +3y + 4z

A005900 ... w = -x + y + z

A192023 ... w = -x + y + z + 2

A212091 ... w^2 = x^2 + y^2 + z^2 ... 3 div

A212087 ... w^2 + x^2 = y^2 + z^2

A212092 ... w^2 < x^2 + y^2 + z^2

A212093 ... w^2 <= x^2 + y^2 + z^2

A212094 ... w^2 > x^2 + y^2 + z^2

A212095 ... w^2 >= x^2 + y^2 + z^2

A212096 ... w^3 = x^3 + y^3 + z^3 ... 6 div

A212097 ... w^3 < x^3 + y^3 + z^3

A212098 ... w^3 <= x^3 + y^3 + z^3

A212099 ... w^3 > x^3 + y^3 + z^3

A212100 ... w^3 >= x^3 + y^3 + z^3

A212101 ... wx^2 = yz^2

A212102 ... 1/w = 1/x + 1/y + 1/z

A212103 ... 3/w = 1/x + 1/y + 1/z; w = h.m. of {x,y,z}

A212104 ... 3/w >= 1/x + 1/y + 1/z; w >= h.m.

A212105 ... 3/w < 1/x + 1/y + 1/z; w < h.m.

A212106 ... 3/w > 1/x + 1/y + 1/z; w > h.m.

A212107 ... 3/w <= 1/x + 1/y + 1/z; w <= h.m.

A212133 ... median(w,x,y,z) = mean(w,x,y,z)

A212134 ... median(w,x,y,z) <= mean(w,x,y,z)

A212135 ... median(w,x,y,z) > mean(w,x,y,z)

A212241 ... wx + yz > n

A212243 ... 2wx + yz = n

A212244 ... w = xyz - n

A212245 ... w = xyz - 2n

A212246 ... 2w = x + y + z - n

A212247 ... 3w = x + y + z + n

A212249 ... 3w < x + y + z + n

A212250 ... 3w >= x + y + z + n

A212251 ... 3w = x + y + z + n + 1

A212252 ... 3w = x + y + z + n + 2

A212254 ... w = x + 2y + 3z - n

A212255 ... w^2 = mean(x^2, y^2, z^2)

A212256 ... 4/w = 1/x + 1/y +1/z + 1/n

In the list above, if the relation in the second column is of the form "w rel ax + by + cz" then the sequence is linearly recurrent. In the list below, the same is true for expressions involving more than one relation.

A000332 ... w < x <= y < z .... C(n,4)

A000914 ... w < x <= y < z .... Stirling 1st kind

A000914 ... w < x <= y >= z ... Stirling 1st kind

A050534 ... w < x < y >= z .... tritriangular

A001296 ... w <= x <= y >= z .. 4-dim pyramidal

A006322 ... x < x > y >= z

A002418 ... w < x >= y < z

A050534 ... w < x >=y >= z

A212415 ... w < x >= y <= z

A001296 ... w < x >= y <= z

A212246 ... w <= x > y <= z

A006322 ... w <= x >= y <= z

A212501 ... w > x < y >= z

A212503 ... w < 2x and y < 2z ..... A (note below)

A212504 ... w < 2x and y > 2z ..... A

A212505 ... w < 2x and y >= 2z .... A

A212506 ... w <= 2x and y <= 2z ... A

A212507 ... w < 2x and y <= 2z .... B

A212508 ... w < 2x and y < 3z ..... C

A212509 ... w < 2x and y <= 3z .... C

A212510 ... w < 2x and y > 3z ..... C

A212511 ... w < 2x and y >= 3z .... C

A212512 ... w <= 2x and y < 3z .... C

A212513 ... w <= 2x and y <= 3z ... C

A212514 ... w <= 2x and y > 3z .... C

A212515 ... w <= 2x and y >= 3z ... C

A212516 ... w > 2x and y < 3z ..... C

A212517 ... w > 2x and y <= 3z .... C

A212518 ... w > 2x and y > 3z ..... C

A212519 ... w > 2x and y >= 3z .... C

A212520 ... w >= 2x and y < 3z .... C

A212521 ... w >= 2x and y <= 3z ... C

A212522 ... w >= 2x and y > 3z .... C

A212523 ... w + x < y + z

A212560 ... w + x <= y + z

A212561 ... w + x = 2y + 2z

A212562 ... w + x < 2y + 2z ....... B

A212563 ... w + x <= 2y + 2z ...... B

A212564 ... w + x > 2y + 2z ....... B

A212565 ... w + x >= 2y + 2z ...... B

A212566 ... w + x = 3y + 3z

A212567 ... 2w + 2x = 3y + 3z

A212570 ... |w - x| = |x - y| + |y - z|

A212571 ... |w - x| < |x - y| + |y - z| ... B ... 4 div

A212572 ... |w - x| <= |x - y| + |y - z| .. B

A212573 ... |w - x| > |x - y| + |y - z| ... B ... 2 div

A212574 ... |w - x| >= |x - y| + |y - z| .. B

A212575 ... 2|w - x| = |x - y| + |y - z|

A212576 ... |w - x| = 2|x - y| + 2|y - z|

A212577 ... |w - x| = 2|x - y| - |y - z|

A212578 ... 2|w - x| = |x - y| - |y - z|

A212579 ... min{|w-x|,|w-y|} = min{|x-y|,|x-z|}

A212692 ... w = |x - y| + |y - z| ............... 2 div

A212568 ... w < |x - y| + |y - z| ............... 2 div

A212573 ... w <= |x - y| + |y - z| .............. 2 div

A212574 ... w > |x - y| + |y - z|

A212575 ... w >= |x - y| + |y - z|

A212676 ... w + x = |x - y| + |y - z| ......... H

A212677 ... w + y = |x - y| + |y - z|

A212678 ... w + x + y = |x - y| + |y - z|

A006918 ... w + x + y + z = |x - y| + |y - z| . H

A212679 ... |x - y| = |y - z| ................. H

A212680 ... |x - y| = |y - z| + 1 ..............H 2 div

A212681 ... |x - y| < |y - z| ................... 2 div

A212682 ... |x - y| >= |y - z|

A212683 ... |x - y| = w + |y - z| ............... 2 div

A212684 ... |x - y| = n - w + |y - z|

A212685 ... |w - x| = w + |y - z|

A186707 ... |w - x| < w + |y - z| ... (Note D)

A212714 ... |w - x| >= w + |y - z| .......... H . 2 div

A212686 ... 2*|w - x| = n + |y - z| ............. 4 div

A212687 ... 2*|w - x| < n + |y - z| ......... B

A212688 ... 2*|w - x| < n + |y - z| ......... B . 2 div

A212689 ... 2*|w - x| > n + |y - z| ......... B . 2 div

A212690 ... 2*|w - x| <= n + |y - z| ........ B

A212691 ... w + |x - y| = |x - z| + |y - z| . E . 2 div

...

In the above lists, all the terms of (w,x,y,z) are in {1,...,n}, but in the next lists they are all in {0,...,n}, and sequences are all linearly recurrent.

R=range{w,x,y,z}=max{w,x,y,z}-min{w,x,y,z}.

A212740 ... max{w,x,y,z} < 2*min{w,x,y,z} .... A

A212741 ... max{w,x,y,z} >= 2*min{w,x,y,z} ... A

A212742 ... max{w,x,y,z} <= 2*min{w,x,y,z} ... A

A212743 ... max{w,x,y,z} > 2*min{w,x,y,z} .... A . 2 div

A212744 ... w=range (=max-min) ............... E

A212745 ... w=max{w,x,y,z} - 2*min{w,x,y,z}

A212746 ... R is in {w,x,y,z} ................ E

A212569 ... R is not in {w,x,y,z} ............ E

A212749 ... w=R or x

A212750 ... w=R or x=R or y

A212751 ... w=R or x=R or y

A212752 ... wR ......... A

A212753 ... wR or z>R ......... D

A212754 ... wR or y>R or z>R ......... D

A002415 ... w = x + R ........................ D

A212755 ... |w - x| = R ...................... D

A212756 ... 2w = x + R

A212757 ... 2w = R

A212758 ... w = floor(R/2)

A002413 ... w = floor((x+y+z/2))

A212759 ... w, x, y are even

A212760 ... w is even and x = y + z .......... E

A212761 ... w is odd and x and y are even .... F . 2 div

A212762 ... w and x are odd y is even ........ F . 2 div

A212763 ... w, x, y are odd .................. F

A212764 ... w, x, y are even and z is odd .... F

A030179 ... w and x are even and y and z odd

A212765 ... w is even and x,y,z are odd ...... F

A212766 ... w is even and x is odd ........... A . 2 div

A212767 ... w and x are even and w+x=y+z ..... E

A212889 ... R is even ........................ A

A212890 ... R is odd ......................... A . 2 div

A212742 ... w-x, x-y, y-z are all even ....... A

A212892 ... w-x, x-y, y-z are all odd ........ A

A212893 ... w-x, x-y, y-z have same parity ... A

A005915 ... min{|w-x|, |x-y|, |y-z|} = 0

A212894 ... min{|w-x|, |x-y|, |y-z|} = 1

A212895 ... min{|w-x|, |x-y|, |y-z|} = 2

A179824 ... min{|w-x|, |x-y|, |y-z|} > 0

A212896 ... min{|w-x|, |x-y|, |y-z|} <= 1

A212897 ... min{|w-x|, |x-y|, |y-z|} > 1

A212898 ... min{|w-x|, |x-y|, |y-z|} <= 2

A212899 ... min{|w-x|, |x-y|, |y-z|} > 2

A212901 ... |w-x| = |x-y| = |y-z|

A212900 ... |w-x|, |x-y|, |y-z| are distinct . G

A212902 ... |w-x| < |x-y| < |y-z| ............ G

A212903 ... |w-x| <= |x-y| <= |y-z| .......... G

A212904 ... |w-x| + |x-y| + |y-z| = n ........ H

A212905 ... |w-x| + |x-y| + |y-z| = 2n ....... H

...

Note A: A212503-A212506 (and others) have these recurrence coefficients: 2,2,-6,0,6,-2,-2,1.

B: 3,-1,-5,5,1,-3,1

C: 0,2,2,-1,-4,0,2,0,-2,0,4,1,-2,-2,0,1

D: 4,-5,0,5,-4,1

E: 1,3,-3,-3,3,1,-1

F: 1,4,-4,-6,6,4,-4,-1,1

G: 2,1,-3,-1,1,3,-1,-2,1

H: 2,1,-4,1,2,-1

			a(2)=11 counts these (w,x,y,z): (1,1,1,1), (1,1,1,2), (1,1,2,1), (2,1,2,1), (2,1,1,2), (1,2,2,1), (1,2,1,2), (1,1,2,2), (1,2,2,2), (2,1,2,2), (2,2,2,2).