cp's OEIS Frontend

It is conjectured (1.1) and then proved by theorem 1.2 that all positive integers can be so represented [Sun, pp. 4-5].

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

These are Hogben's central polygonal numbers denoted by the symbol

...2....

....P...

...2.n..

(P with three attachments).

Also the maximal number of 1's that an n X n invertible {0,1} matrix can have. (See Halmos for proof.) - Felix Goldberg (felixg(AT)tx.technion.ac.il), Jul 07 2001

Maximal number of interior regions formed by n intersecting circles, for n >= 1. - Amarnath Murthy, Jul 07 2001

The terms are the smallest of n consecutive odd numbers whose sum is n^3: 1, 3 + 5 = 8 = 2^3, 7 + 9 + 11 = 27 = 3^3, etc. - Amarnath Murthy, May 19 2001

(n*a(n+1)+1)/(n^2+1) is the smallest integer of the form (n*k+1)/(n^2+1). - Benoit Cloitre, May 02 2002

For n >= 3, a(n) is also the number of cycles in the wheel graph W(n) of order n. - Sharon Sela (sharonsela(AT)hotmail.com), May 17 2002

Let b(k) be defined as follows: b(1) = 1 and b(k+1) > b(k) is the smallest integer such that Sum_{i=b(k)..b(k+1)} 1/sqrt(i) > 2; then b(n) = a(n) for n > 0. - Benoit Cloitre, Aug 23 2002

Drop the first three terms. Then n*a(n) + 1 = (n+1)^3. E.g., 7*1 + 1 = 8 = 2^3, 13*2 + 1 = 27 = 3^3, 21*3 + 1 = 64 = 4^3, etc. - Amarnath Murthy, Oct 20 2002

Arithmetic mean of next 2n - 1 numbers. - Amarnath Murthy, Feb 16 2004

The n-th term of an arithmetic progression with first term 1 and common difference n: a(1) = 1 -> 1, 2, 3, 4, 5, ...; a(2) = 3 -> 1, 3, ...; a(3) = 7 -> 1, 4, 7, ...; a(4) = 13 -> 1, 5, 9, 13, ... - Amarnath Murthy, Mar 25 2004

Number of walks of length 3 between any two distinct vertices of the complete graph K_{n+1} (n >= 1). Example: a(2) = 3 because in the complete graph ABC we have the following walks of length 3 between A and B: ABAB, ACAB and ABCB. - Emeric Deutsch, Apr 01 2004

Narayana transform of [1, 2, 0, 0, 0, ...] = [1, 3, 7, 13, 21, ...]. Let M = the infinite lower triangular matrix of A001263 and let V = the Vector [1, 2, 0, 0, 0, ...]. Then A002061 starting (1, 3, 7, ...) = M * V. - Gary W. Adamson, Apr 25 2006

The sequence 3, 7, 13, 21, 31, 43, 57, 73, 91, 111, ... is the trajectory of 3 under repeated application of the map n -> n + 2 * square excess of n, cf. A094765.

Also n^3 mod (n^2+1). - Zak Seidov, Aug 31 2006

Also, omitting the first 1, the main diagonal of A081344. - Zak Seidov, Oct 05 2006

Ignoring the first ones, these are rectangular parallelepipeds with integer dimensions that have integer interior diagonals. Using Pythagoras: sqrt(a^2 + b^2 + c^2) = d, an integer; then this sequence: sqrt(n^2 + (n+1)^2 + (n(n+1))^2) = 2T_n + 1 is the first and most simple example. Problem: Are there any integer diagonals which do not satisfy the following general formula? sqrt((k*n)^2 + (k*(n+(2*m+1)))^2 + (k*(n*(n+(2*m+1)) + 4*T_m))^2) = k*d where m >= 0, k >= 1, and T is a triangular number. - Marco Matosic, Nov 10 2006

Numbers n such that a(n) is prime are listed in A055494. Prime a(n) are listed in A002383. All terms are odd. Prime factors of a(n) are listed in A007645. 3 divides a(3*k-1), 7 divides a(7*k-4) and a(7*k-2), 7^2 divides a(7^2*k-18) and a(7^2*k+19), 7^3 divides a(7^3*k-18) and a(7^3*k+19), 7^4 divides a(7^4*k+1048) and a(7^4*k-1047), 7^5 divides a(7^5*k+1354) and a(7^5*k-1353), 13 divides a(13*k-9) and a(13*k-3), 13^2 divides a(13^2*k+23) and a(13^2*k-22), 13^3 divides a(13^3*k+1037) and a(13^3*k-1036). - Alexander Adamchuk, Jan 25 2007

Complement of A135668. - Kieren MacMillan, Dec 16 2007

From William A. Tedeschi, Feb 29 2008: (Start)

Numbers (sorted) on the main diagonal of a 2n X 2n spiral. For example, when n=2:

.

7---8---9--10

| |

6 1---2 11

| | |

5---4---3 12

|

16--15--14--13

.

Cf. A137928. (End)

a(n) = AlexanderPolynomial[n] defined as Det[Transpose[S]-n S] where S is Seifert matrix {{-1, 1}, {0, -1}}. - Artur Jasinski, Mar 31 2008

Starting (1, 3, 7, 13, 21, ...) = binomial transform of [1, 2, 2, 0, 0, 0]; example: a(4) = 13 = (1, 3, 3, 1) dot (1, 2, 2, 0) = (1 + 6 + 6 + 0). - Gary W. Adamson, May 10 2008

Starting (1, 3, 7, 13, ...) = triangle A158821 * [1, 2, 3, ...]. - Gary W. Adamson, Mar 28 2009

Starting with offset 1 = triangle A128229 * [1,2,3,...]. - Gary W. Adamson, Mar 26 2009

a(n) = k such that floor((1/2)*(1 + sqrt(4*k-3))) + k = (n^2+1), that is A000037(a(n)) = A002522(n) = n^2 + 1, for n >= 1. - Jaroslav Krizek, Jun 21 2009

For n > 0: a(n) = A170950(A002522(n-1)), A170950(a(n)) = A174114(n), A170949(a(n)) = A002522(n-1). - Reinhard Zumkeller, Mar 08 2010

From Emeric Deutsch, Sep 23 2010: (Start)

a(n) is also the Wiener index of the fan graph F(n). The fan graph F(n) is defined as the graph obtained by joining each node of an n-node path graph with an additional node. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. The Wiener polynomial of the graph F(n) is (1/2)t[(n-1)(n-2)t + 2(2n-1)]. Example: a(2)=3 because the corresponding fan graph is a cycle on 3 nodes (a triangle), having distances 1, 1, and 1.

(End)

For all elements k = n^2 - n + 1 of the sequence, sqrt(4*(k-1)+1) is an integer because 4*(k-1) + 1 = (2*n-1)^2 is a perfect square. Building the intersection of this sequence with A000225, k may in addition be of the form k = 2^x - 1, which happens only for k = 1, 3, 7, 31, and 8191. [Proof: Still 4*(k-1)+1 = 2^(x+2) - 7 must be a perfect square, which has the finite number of solutions provided by A060728: x = 1, 2, 3, 5, or 13.] In other words, the sequence A038198 defines all elements of the form 2^x - 1 in this sequence. For example k = 31 = 6*6 - 6 + 1; sqrt((31-1)*4+1) = sqrt(121) = 11 = A038198(4). - Alzhekeyev Ascar M, Jun 01 2011

a(n) such that A002522(n-1) * A002522(n) = A002522(a(n)) where A002522(n) = n^2 + 1. - Michel Lagneau, Feb 10 2012

Left edge of the triangle in A214661: a(n) = A214661(n, 1), for n > 0. - Reinhard Zumkeller, Jul 25 2012

a(n) = A215630(n, 1), for n > 0; a(n) = A215631(n-1, 1), for n > 1. - Reinhard Zumkeller, Nov 11 2012

Sum_{n > 0} arccot(a(n)) = Pi/2. - Franz Vrabec, Dec 02 2012

If you draw a triangle with one side of unit length and one side of length n, with an angle of Pi/3 radians between them, then the length of the third side of the triangle will be the square root of a(n). - Elliott Line, Jan 24 2013

a(n+1) is the number j such that j^2 = j + m + sqrt(j*m), with corresponding number m given by A100019(n). Also: sqrt(j*m) = A027444(n) = n * a(n+1). - Richard R. Forberg, Sep 03 2013

Let p(x) the interpolating polynomial of degree n-1 passing through the n points (n,n) and (1,1), (2,1), ..., (n-1,1). Then p(n+1) = a(n). - Giovanni Resta, Feb 09 2014

The number of square roots >= sqrt(n) and < n+1 (n >= 0) gives essentially the same sequence, 1, 3, 7, 13, 21, 31, 43, 57, 73, 91, 111, 133, 157, 183, 211, ... . - Michael G. Kaarhus, May 21 2014

For n > 1: a(n) is the maximum total number of queens that can coexist without attacking each other on an [n+1] X [n+1] chessboard. Specifically, this will be a lone queen of one color placed in any position on the perimeter of the board, facing an opponent's "army" of size a(n)-1 == A002378(n-1). - Bob Selcoe, Feb 07 2015

a(n+1) is, for n >= 1, the number of points as well as the number of lines of a finite projective plane of order n (cf. Hughes and Piper, 1973, Theorem 3.5., pp. 79-80). For n = 3, a(4) = 13, see the 'Finite example' in the Wikipedia link, section 2.3, for the point-line matrix. - Wolfdieter Lang, Nov 20 2015

Denominators of the solution to the generalization of the Feynman triangle problem. If each vertex of a triangle is joined to the point (1/p) along the opposite side (measured say clockwise), then the area of the inner triangle formed by these lines is equal to (p - 2)^2/(p^2 - p + 1) times the area of the original triangle, p > 2. For example, when p = 3, the ratio of the areas is 1/7. The numerators of the ratio of the areas is given by A000290 with an offset of 2. [Cook & Wood, 2004.] - Joe Marasco, Feb 20 2017

n^2 equal triangular tiles with side lengths 1 X 1 X 1 may be put together to form an n X n X n triangle. For n>=2 a(n-1) is the number of different 2 X 2 X 2 triangles being contained. - Heinrich Ludwig, Mar 13 2017

For n >= 0, the continued fraction [n, n+1, n+2] = (n^3 + 3n^2 + 4n + 2)/(n^2 + 3n + 3) = A034262(n+1)/a(n+2) = n + (n+2)/a(n+2); e.g., [2, 3, 4] = A034262(3)/a(4) = 30/13 = 2 + 4/13. - Rick L. Shepherd, Apr 06 2017

Starting with b(1) = 1 and not allowing the digit 0, let b(n) = smallest nonnegative integer not yet in the sequence such that the last digit of b(n-1) plus the first digit of b(n) is equal to k for k = 1, ..., 9. This defines 9 finite sequences, each of length equal to a(k), k = 1, ..., 9. (See A289283-A289287 for the cases k = 5..9.) For k = 10, the sequence is infinite (A289288). For example, for k = 4, b(n) = 1,3,11,31,32,2,21,33,12,22,23,13,14. These terms can be ordered in the following array of size k*(k-1)+1:

1 2 3

21 22 23

31 32 33

11 12 13 14

.

The sequence ends with the term 1k, which lies outside the rectangular array and gives the term +1 (see link).- Enrique Navarrete, Jul 02 2017

The central polygonal numbers are the delimiters (in parenthesis below) when you write the natural numbers in groups of odd size 2*n+1 starting with the group {2} of size 1: (1) 2 (3) 4,5,6 (7) 8,9,10,11,12 (13) 14,15,16,17,18,19,20 (21) 22,23,24,25,26,27,28,29,30 (31) 32,33,34,35,36,37,38,39,40,41,42 (43) ... - Enrique Navarrete, Jul 11 2017

Also the number of (non-null) connected induced subgraphs in the n-cycle graph. - Eric W. Weisstein, Aug 09 2017

Since (n+1)^2 - (n+1) + 1 = n^2 + n + 1 then from 7 onwards these are also exactly the numbers that are represented as 111 in all number bases: 111(2)=7, 111(3)=13, ... - Ron Knott, Nov 14 2017

Number of binary 2 X (n-1) matrices such that each row and column has at most one 1. - Dmitry Kamenetsky, Jan 20 2018

Observed to be the squares visited by bishop moves on a spirally numbered board and moving to the lowest available unvisited square at each step, beginning at the second term (cf. A316667). It should be noted that the bishop will only travel to squares along the first diagonal of the spiral. - Benjamin Knight, Jan 30 2019

From Ed Pegg Jr, May 16 2019: (Start)

Bound for n-subset coverings. Values in A138077 covered by difference sets.

C(7,3,2), {1,2,4}

C(13,4,2), {0,1,3,9}

C(21,5,2), {3,6,7,12,14}

C(31,6,2), {1,5,11,24,25,27}

C(43,7,2), existence unresolved

C(57,8,2), {0,1,6,15,22,26,45,55}

Next unresolved cases are C(111,11,2) and C(157,13,2). (End)

"In the range we explored carefully, the optimal packings were substantially irregular only for n of the form n = k(k+1)+1, k = 3, 4, 5, 6, 7, i.e., for n = 13, 21, 31, 43, and 57." (cited from Lubachevsky, Graham link, Introduction). - Rainer Rosenthal, May 27 2020

From Bernard Schott, Dec 31 2020: (Start)

For n >= 1, a(n) is the number of solutions x in the interval 1 <= x <= n of the equation x^2 - [x^2] = (x - [x])^2, where [x] = floor(x). For n = 3, the a(3) = 7 solutions in the interval [1, 3] are 1, 3/2, 2, 9/4, 5/2, 11/4 and 3.

This sequence is the answer to the 4th problem proposed during the 20th British Mathematical Olympiad in 1984 (see link B.M.O 1984. and Gardiner reference). (End)

Called "Hogben numbers" after the British zoologist, statistician and writer Lancelot Thomas Hogben (1895-1975). - Amiram Eldar, Jun 24 2021

Minimum Wiener index of 2-degenerate graphs with n+1 vertices (n>0). A maximal 2-degenerate graph can be constructed from a 2-clique by iteratively adding a new 2-leaf (vertex of degree 2) adjacent to two existing vertices. The extremal graphs are maximal 2-degenerate graphs with diameter at most 2. - Allan Bickle, Oct 14 2022

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

Repeated iteration of a(k) starting with k=2 produces Sylvester's sequence, i.e., A000058(n) = a^n(2), where a^n is the n-th iterate of a(k). - Curtis Bechtel, Apr 04 2024

a(n) is the maximum number of triangles that can be traversed by starting from a triangle and moving to adjacent triangles via an edge, without revisiting any triangle, in an n X n X n equilateral triangular grid made up of n^2 unit equilateral triangles. - Kiran Ananthpur Bacche, Jan 16 2025

Erdős conjectured that n^2 - 1 = k! has a solution if and only if n is 5, 11 or 71 (when k is 4, 5 or 7).

Second-order linear recurrences y(m) = 2y(m-1) + a(n)*y(m-2), y(0) = y(1) = 1, have closed form solutions involving only powers of integers. - Len Smiley, Dec 08 2001

Number of edges in the join of two cycle graphs, both of order n, C_n * C_n. - Roberto E. Martinez II, Jan 07 2002

Let k be a positive integer, M_n be the n X n matrix m_(i,j) = k^abs(i-j) then det(M_n) = (-1)^(n-1)*a(k-1)^(n-1). - Benoit Cloitre, May 28 2002

Also numbers k such that 4*k + 4 is a square. - Cino Hilliard, Dec 18 2003

For each term k, the function sqrt(x^2 + 1), starting with 1, produces an integer after k iterations. - Gerald McGarvey, Aug 19 2004

a(n) mod 3 = 0 if and only if n mod 3 > 0: a(A008585(n)) = 2; a(A001651(n)) = 0; a(n) mod 3 = 2*(1-A079978(n)). - Reinhard Zumkeller, Oct 16 2006

a(n) is the number of divisors of a(n+1) that are not greater than n. - Reinhard Zumkeller, Apr 09 2007

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

Sequence allows us to find X values of the equation: X + (X + 1)^2 + (X + 2)^3 = Y^2. To prove that X = n^2 + 2n: Y^2 = X + (X + 1)^2 + (X + 2)^3 = X^3 + 7*X^2 + 15X + 9 = (X + 1)(X^2 + 6X + 9) = (X + 1)*(X + 3)^2 it means: (X + 1) must be a perfect square, so X = k^2 - 1 with k>=1. we can put: k = n + 1, which gives: X = n^2 + 2n and Y = (n + 1)(n^2 + 2n + 3). - Mohamed Bouhamida, Nov 12 2007

From R. K. Guy, Feb 01 2008: (Start)

Toads and Frogs puzzle:

This is also the number of moves that it takes n frogs to swap places with n toads on a strip of 2n + 1 squares (or positions, or lily pads) where a move is a single slide or jump, illustrated for n = 2, a(n) = 8 by

T T - F F

T - T F F

T F T - F

T F T F -

T F - F T

- F T F T

F - T F T

F F T - T

F F - T T

I was alerted to this by the Holton article, but on consulting Singmaster's sources, I find that the puzzle goes back at least to 1867.

Probably the first to publish the number of moves for n of each animal was Edouard Lucas in 1883. (End)

a(n+1) = terms of rank 0, 1, 3, 6, 10 = A000217 of A120072 (3, 8, 5, 15). - Paul Curtz, Oct 28 2008

Row 3 of array A163280, n >= 1. - Omar E. Pol, Aug 08 2009

Final digit belongs to a periodic sequence: 0, 3, 8, 5, 4, 5, 8, 3, 0, 9. - Mohamed Bouhamida, Sep 04 2009 [Comment edited by N. J. A. Sloane, Sep 24 2009]

Let f(x) be a polynomial in x. Then f(x + n*f(x)) is congruent to 0 (mod f(x)); here n belongs to N. There is nothing interesting in the quotients f(x + n*f(x))/f(x) when x belongs to Z. However, when x is irrational these quotients consist of two parts, a) rational integers and b) integer multiples of x. The present sequence represents the non-integer part when the polynomial is x^2 + x + 1 and x = sqrt(2), f(x+n*f(x))/f(x) = A056108(n) + a(n)*sqrt(2). - A.K. Devaraj, Sep 18 2009

For n >= 1, a(n) is the number for which 1/a(n) = 0.0101... (A000035) in base (n+1). - Rick L. Shepherd, Sep 27 2009

For n > 0, continued fraction [n, 1, n] = (n+1)/a(n); e.g., [6, 1, 6] = 7/48. - Gary W. Adamson, Jul 15 2010

Starting (3, 8, 15, ...) = binomial transform of [3, 5, 2, 0, 0, 0, ...]; e.g., a(3) = 15 = (1*3 + 2*5 +1*2) = (3 + 10 + 2). - Gary W. Adamson, Jul 30 2010

a(n) is essentially the case 0 of the polygonal numbers. The polygonal numbers are defined as P_k(n) = Sum_{i=1..n} ((k-2)*i-(k-3)). Thus P_0(n) = 2*n-n^2 and a(n) = -P_0(n+2). See also A067998 and for the case k=1 A080956. - Peter Luschny, Jul 08 2011

a(n) is the maximal determinant of a 2 X 2 matrix with integer elements from {1, ..., n+1}, so the maximum determinant of a 2x2 matrix with integer elements from {1, ..., 5} = 5^2 - 1 = a(4) = 24. - Aldo González Lorenzo, Oct 12 2011

Using four consecutive triangular numbers t1, t2, t3 and t4, plot the points (0, 0), (t1, t2), and (t3, t4) to create a triangle. Twice the area of this triangle are the numbers in this sequence beginning with n = 1 to give 8. - J. M. Bergot, May 03 2012

Given a particle with spin S = n/2 (always a half-integer value), the quantum-mechanical expectation value of the square of the magnitude of its spin vector evaluates to = S(S+1) = n(n+2)/4, i.e., one quarter of a(n) with n = 2S. This plays an important role in the theory of magnetism and magnetic resonance. - Stanislav Sykora, May 26 2012

Twice the harmonic mean [H(x, y) = (2*x*y)/(x + y)] of consecutive triangular numbers A000217(n) and A000217(n+1). - Raphie Frank, Sep 28 2012

Number m such that floor(sqrt(m)) = floor(m/floor(sqrt(m))) - 2 for m > 0. - Takumi Sato, Oct 10 2012

The solutions of equation 1/(i - sqrt(j)) = i + sqrt(j), when i = (n+1), j = a(n). For n = 1, 2 + sqrt(3) = 3.732050.. = A019973. For n = 2, 3 + sqrt(8) = 5.828427... = A156035. - Kival Ngaokrajang, Sep 07 2013

The integers in the closed form solution of a(n) = 2*a(n-1) + a(m-2)*a(n-2), n >= 2, a(0) = 0, a(1) = 1 mentioned by Len Smiley, Dec 08 2001, are m and -m + 2 where m >= 3 is a positive integer. - Felix P. Muga II, Mar 18 2014

Let m >= 3 be a positive integer. If a(n) = 2*a(n-1) + a(m-2) * a(n-2), n >= 2, a(0) = 0, a(1) = 1, then lim_{n->oo} a(n+1)/a(n) = m. - Felix P. Muga II, Mar 18 2014

For n >= 4 the Szeged index of the wheel graph W_n (with n + 1 vertices). In the Sarma et al. reference, Theorem 2.7 is incorrect. - Emeric Deutsch, Aug 07 2014

If P_{k}(n) is the n-th k-gonal number, then a(n) = t*P_{s}(n+2) - s*P_{t}(n+2) for s=t+1. - Bruno Berselli, Sep 04 2014

For n >= 1, a(n) is the dimension of the simple Lie algebra A_n. - Wolfdieter Lang, Oct 21 2015

Finding all positive integers (n, k) such that n^2 - 1 = k! is known as Brocard's problem, (see A085692). - David Covert, Jan 15 2016

For n > 0, a(n) mod (n+1) = a(n) / (n+1) = n. - Torlach Rush, Apr 04 2016

Conjecture: When using the Sieve of Eratosthenes and sieving (n+1..a(n)), with divisors (1..n) and n>0, there will be no more than a(n-1) composite numbers. - Fred Daniel Kline, Apr 08 2016

a(n) mod 8 is periodic with period 4 repeating (0,3,0,7), that is a(n) mod 8 = 5/2 - (5/2) cos(n*Pi) - sin(n*Pi/2) + sin(3*n*Pi/2). - Andres Cicuttin, Jun 02 2016

Also for n > 0, a(n) is the number of times that n-1 occurs among the first (n+1)! terms of A055881. - R. J. Cano, Dec 21 2016

The second diagonal of composites (the only prime is number 3) from the right on the Klauber triangle (see Kival Ngaokrajang link), which is formed by taking the positive integers and taking the first 1, the next 3, the following 5, and so on, each centered below the last. - Charles Kusniec, Jul 03 2017

Also the number of independent vertex sets in the n-barbell graph. - Eric W. Weisstein, Aug 16 2017

Interleaving of A000466 and A033996. - Bruce J. Nicholson, Nov 08 2019

a(n) is the number of degrees of freedom in a triangular cell for a Raviart-Thomas or Nédélec first kind finite element space of order n. - Matthew Scroggs, Apr 22 2020

From Muge Olucoglu, Jan 19 2021: (Start)

For n > 1, a(n-2) is the maximum number of elements in the second stage of the Quine-McCluskey algorithm whose minterms are not covered by the functions of n bits. At n=3, we have a(3-2) = a(1) = 1*(1+2) = 3 and f(A,B,C) = sigma(0,1,2,5,6,7).

.

0 1 2 5 6 7

+---------------

*(0,1)| X X

(0,2)| X X

(1,5)| X X

*(2,6)| X X

*(5,7)| X X

(6,7)| X X

.

*: represents the elements that are covered. (End)

1/a(n) is the ratio of the sum of the first k odd numbers and the sum of the next n*k odd numbers. - Melvin Peralta, Jul 15 2021

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

Number of diagonals parallel to an edge in a regular (2*n+4)-gon (cf. A367204). - Paolo Xausa, Nov 21 2023

For n >= 1, also the number of minimum cyclic edge cuts in the (n+2)-trapezohedron graph. - Eric W. Weisstein, Nov 21 2024

For n >= 1, a(n) is the sum of the interior angles of a polygon with n+2 sides, in radians, multiplied by (n+2)/Pi. - Stuart E Anderson, Aug 06 2025

The brown rat (rattus norwegicus) breeds very quickly. It can give birth to other rats 7 times a year, starting at the age of three months. The average number of pups is 8. The present sequence gives the total number of rats, when the intervals are 12/7 of a year and a young rat starts having offspring at 24/7 of a year. - Hans Isdahl, Jan 26 2008

Numbers n such that tau(n) is odd where tau(x) denotes the Ramanujan tau function (A000594). - Benoit Cloitre, May 01 2003

If Y is a fixed 2-subset of a (2n+1)-set X then a(n-1) is the number of 3-subsets of X intersecting Y. - Milan Janjic, Oct 21 2007

Binomial transform of [1, 8, 8, 0, 0, 0, ...]; Narayana transform (A001263) of [1, 8, 0, 0, 0, ...]. - Gary W. Adamson, Dec 29 2007

All terms of this sequence are of the form 8k+1. For numbers 8k+1 which aren't squares see A138393. Numbers 8k+1 are squares iff k is a triangular number from A000217. And squares have form 4n(n+1)+1. - Artur Jasinski, Mar 27 2008

Sequence arises from reading the line from 1, in the direction 1, 25, ... and the line from 9, in the direction 9, 49, ..., in the square spiral whose vertices are the squares A000290. - Omar E. Pol, May 24 2008

Equals the triangular numbers convolved with [1, 6, 1, 0, 0, 0, ...]. - Gary W. Adamson & Alexander R. Povolotsky, May 29 2009

First differences: A008590(n) = a(n) - a(n-1) for n>0. - Reinhard Zumkeller, Nov 08 2009

Central terms of the triangle in A176271; cf. A000466, A053755. - Reinhard Zumkeller, Apr 13 2010

Odd numbers with odd abundance. Odd numbers with even abundance are in A088828. Even numbers with odd abundance are in A088827. Even numbers with even abundance are in A088829. - Jaroslav Krizek, May 07 2011

Appear as numerators in the non-simple continued fraction expansion of Pi-3: Pi-3 = K_{k>=1} (1-2*k)^2/6 = 1/(6+9/(6+25/(6+49/(6+...)))), see also the comment in A007509. - Alexander R. Povolotsky, Oct 12 2011

Ulam's spiral (SE spoke). - Robert G. Wilson v, Oct 31 2011

All terms end in 1, 5 or 9. Modulo 100, all terms are among { 1, 9, 21, 25, 29, 41, 49, 61, 69, 81, 89 }. - M. F. Hasler, Mar 19 2012

Right edge of both triangles A214604 and A214661: a(n) = A214604(n+1,n+1) = A214661(n+1,n+1). - Reinhard Zumkeller, Jul 25 2012

Also: Odd numbers which have an odd sum of divisors (= sigma = A000203). - M. F. Hasler, Feb 23 2013

Consider primitive Pythagorean triangles (a^2 + b^2 = c^2, gcd(a, b) = 1) with hypotenuse c (A020882) and respective even leg b (A231100); sequence gives values c-b, sorted with duplicates removed. - K. G. Stier, Nov 04 2013

For n>1 a(n) is twice the area of the irregular quadrilateral created by the points ((n-2)*(n-1),(n-1)*n/2), ((n-1)*n/2,n*(n+1)/2), ((n+1)*(n+2)/2,n*(n+1)/2), and ((n+2)*(n+3)/2,(n+1)*(n+2)/2). - J. M. Bergot, May 27 2014

Number of pairs (x, y) of Z^2, such that max(abs(x), abs(y)) <= n. - Michel Marcus, Nov 28 2014

Except for a(1)=4, the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 737", based on the 5-celled von Neumann neighborhood. - Robert Price, May 23 2016

a(n) is the sum of 2n+1 consecutive numbers, the first of which is n+1. - Ivan N. Ianakiev, Dec 21 2016

a(n) is the number of 2 X 2 matrices with all elements in {0..n} with determinant = 2*permanent. - Indranil Ghosh, Dec 25 2016

Engel expansion of Pi*StruveL_0(1)/2 where StruveL_0(1) is A197037. - Benedict W. J. Irwin, Jun 21 2018

Consider all Pythagorean triples (X,Y,Z=Y+1) ordered by increasing Z; the segments on the hypotenuse {p = a(n)/A001844(n), q = A060300(n)/A001844(n) = A001844(n) - p} and their ratio p/q = a(n)/A060300(n) are irreducible fractions in Q\Z. X values are A005408, Y values are A046092, Z values are A001844. - Ralf Steiner, Feb 25 2020

a(n) is the number of large or small squares that are used to tile primitive squares of type 2 (A344332). - Bernard Schott, Jun 03 2021

Also, positive odd integers with an odd number of odd divisors (for similar sequence with 'even', see A348005). - Bernard Schott, Nov 21 2021

a(n) is the least odd number k = x + y, with 0 < x < y, such that there are n distinct pairs (x,y) for which x*y/k is an integer; for example, a(2) = 25 and the two corresponding pairs are (5,20) and (10,15). The similar sequence with 'even' is A016742 (see Comment of Jan 26 2018). - Bernard Schott, Feb 24 2023

From Peter Bala, Jan 03 2024: (Start)

The sequence terms are the exponents of q in the series expansions of the following infinite products:

1) q*Product_{n >= 1} (1 - q^(16*n))*(1 + q^(8*n)) = q + q^9 + q^25 + q^49 + q^81 + q^121 + q^169 + ....

2) q*Product_{n >= 1} (1 + q^(16*n))*(1 - q^(8*n)) = q - q^9 - q^25 + q^49 + q^81 - q^121 - q^169 + + - - ....

3) q*Product_{n >= 1} (1 - q^(8*n))^3 = q - 3*q^9 + 5*q^25 - 7*q^49 + 9*q^81 - 11*q^121 + 13*q^169 - + ....

4) q*Product_{n >= 1} ( (1 + q^(8*n))*(1 - q^(16*n))/(1 + q^(16*n)) )^3 = q + 3*q^9 - 5*q^25 - 7*q^49 + 9*q^81 + 11*q^121 - 13*q^169 - 15*q^225 + + - - .... (End)

Number of edges of the complete bipartite graph of order 3n, K_{n,2n}. - Roberto E. Martinez II, Jan 07 2002

"If each period in the periodic system ends in a rare gas ..., the number of elements in a period can be found from the ordinal number n of the period by the formula: L = ((2n+3+(-1)^n)^2)/8..." - Nature, Jun 09 1951; Nature 411 (Jun 07 2001), p. 648. This produces the present sequence doubled up.

Let z(1) = i = sqrt(-1), z(k+1) = 1/(z(k)+2i); then a(n) = (-1)*Imag(z(n+1))/Real(z(n+1)). - Benoit Cloitre, Aug 06 2002

Maximum number of electrons in an atomic shell with total quantum number n. Partial sums of A016825. - Jeremy Gardiner, Dec 19 2004

Arithmetic mean of triangular numbers in pairs: (1+3)/2, (6+10)/2, (15+21)/2, ... . - Amarnath Murthy, Aug 05 2005

These numbers form a pattern on the Ulam spiral similar to that of the triangular numbers. - G. Roda, Oct 20 2010

Integral areas of isosceles right triangles with rational legs (legs are 2n and triangles are nondegenerate for n > 0). - Rick L. Shepherd, Sep 29 2009

Even squares divided by 2. - Omar E. Pol, Aug 18 2011

Number of stars when distributed as in the U.S.A. flag: n rows with n+1 stars and, between each pair of these, one row with n stars (i.e., n-1 of these), i.e., n*(n+1)+(n-1)*n = 2*n^2 = A001105(n). - César Eliud Lozada, Sep 17 2012

Apparently the number of Dyck paths with semilength n+3 and an odd number of peaks and the central peak having height n-3. - David Scambler, Apr 29 2013

Sum of the partition parts of 2n into exactly two parts. - Wesley Ivan Hurt, Jun 01 2013

Consider primitive Pythagorean triangles (a^2 + b^2 = c^2, gcd(a, b) = 1) with hypotenuse c (A020882) and respective odd leg a (A180620); sequence gives values c-a, sorted with duplicates removed. - K. G. Stier, Nov 04 2013

Number of roots in the root systems of type B_n and C_n (for n > 1). - Tom Edgar, Nov 05 2013

Area of a square with diagonal 2n. - Wesley Ivan Hurt, Jun 18 2014

This sequence appears also as the first and second member of the quartet [a(n), a(n), p(n), p(n)] of the square of [n, n, n+1, n+1] in the Clifford algebra Cl_2 for n >= 0. p(n) = A046092(n). See an Oct 15 2014 comment on A147973 where also a reference is given. - Wolfdieter Lang, Oct 16 2014

a(n) are the only integers m where (A000005(m) + A000203(m)) = (number of divisors of m + sum of divisors of m) is an odd number. - Richard R. Forberg, Jan 09 2015

a(n) represents the first term in a sum of consecutive integers running to a(n+1)-1 that equals (2n+1)^3. - Patrick J. McNab, Dec 24 2016

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

Also the Wiener index of the n-cocktail party graph for n > 1. - Eric W. Weisstein, Sep 07 2017

Numbers represented as the palindrome 242 in number base B including B=2 (binary), 3 (ternary) and 4: 242(2)=18, 242(3)=32, 242(4)=50, ... 242(9)=200, 242(10)=242, ... - Ron Knott, Nov 14 2017

a(n) is the square of the hypotenuse of an isosceles right triangle whose sides are equal to n. - Thomas M. Green, Aug 20 2019

The sequence contains all odd powers of 2 (A004171) but no even power of 2 (A000302). - Torlach Rush, Oct 10 2019

From Bernard Schott, Aug 31 2021 and Sep 16 2021: (Start)

Apart from 0, integers such that the number of even divisors (A183063) is odd.

Proof: every n = 2^q * (2k+1), q, k >= 0, then 2*n^2 = 2^(2q+1) * (2k+1)^2; now, gcd(2, 2k+1) = 1, tau(2^(2q+1)) = 2q+2 and tau((2k+1)^2) = 2u+1 because (2k+1)^2 is square, so, tau(2*n^2) = (2q+2) * (2u+1).

The 2q+2 divisors of 2^(2q+1) are {1, 2, 2^2, 2^3, ..., 2^(2q+1)}, so 2^(2q+1) has 2q+1 even divisors {2^1, 2^2, 2^3, ..., 2^(2q+1)}.

Conclusion: these 2q+1 even divisors create with the 2u+1 odd divisors of (2k+1)^2 exactly (2q+1)*(2u+1) even divisors of 2*n^2, and (2q+1)*(2u+1) is odd. (End)

a(n) with n>0 are the numbers with period length 2 for Bulgarian and Mancala solitaire. - Paul Weisenhorn, Jan 29 2022

Number of points at L1 distance = 2 from any given point in Z^n. - Shel Kaphan, Feb 25 2023

Integer that multiplies (h^2)/(m*L^2) to give the energy of a 1-D quantum mechanical particle in a box whenever it is an integer multiple of (h^2)/(m*L^2), where h = Planck's constant, m = mass of particle, and L = length of box. - A. Timothy Royappa, Mar 14 2025

Write 0, 1, 2, ... in a square spiral, with 0 at the origin and 1 immediately below it; sequence gives numbers on the negative y-axis (see Example section).

Number of divisors of 48^(n-1) for n > 0. - J. Lowell, Aug 30 2008

a(n) is the Wiener index of the graph obtained by connecting two copies of the complete graph K_n by an edge (for n = 3, approximately: |>-<|). The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices in the graph. - Emeric Deutsch, Sep 20 2010

This sequence does not contain any squares other than 0 and 1. See A188896. - T. D. Noe, Apr 13 2011

For n > 0: right edge of the triangle A033293. - Reinhard Zumkeller, Jan 18 2012

Sequence found by reading the line from 0, in the direction 0, 10, ... and the parallel line from 1, in the direction 1, 27, ..., in the square spiral whose vertices are the generalized decagonal numbers A074377. - Omar E. Pol, Jul 18 2012

Partial sums give A007585. - Omar E. Pol, Jan 15 2013

This is also a star pentagonal number: a(n) = A000326(n) + 5*A000217(n-1). - Luciano Ancora, Mar 28 2015

Also the number of undirected paths in the n-sunlet graph. - Eric W. Weisstein, Sep 07 2017

After 0, a(n) is the sum of 2*n consecutive integers starting from n-1. - Bruno Berselli, Jan 16 2018

Number of corona of an H0 hexagon with a T(n) triangle. - Craig Knecht, Dec 13 2024

Binomial transform of A046717. Second binomial transform of A000302 (with interpolated zeros). Partial sums are A007583.

Counts closed walks of length 2n at a vertex of the cyclic graph on 4 nodes C_4. With interpolated zeros, counts closed walks of length n at a vertex of the cyclic graph on 4 nodes C_4. - Paul Barry, Mar 10 2004

In general, Sum_{k=0..n} Sum_{j=0..n} C(2*(n-k), j)*C(2*k, j)*r^j has expansion (1 - (r+1)*x)/(1 - (r+3)*x - (r-1)*(r+3)*x^2 + (r-1)^3*x^3). - Paul Barry, Jun 04 2005 [corrected by Jason Yuen, Jan 20 2025]

a(n) is the number of binary strings of length 2n with an even number of 0's (and hence an even number of 1's). - Toby Gottfried, Mar 22 2010

Number of compositions of n where there are 2 sorts of part 1, 4 sorts of part 2, 8 sorts of part 3, ..., 2^k sorts of part k. - Joerg Arndt, Aug 04 2014

a(n) is also the number of permutations simultaneously avoiding 231 and 321 in the classical sense which can be realized as labels on an increasing strict binary tree with 2n-1 nodes. See A245904 for more information on increasing strict binary trees. - Manda Riehl Aug 07 2014

INVERT transform of powers of 2 (A000079). - Alois P. Heinz, Feb 11 2021

a(n) is the number of elements in an n-interval of the binomial poset of even-sized subsets of positive integers, cf. Stanley reference and second formula by Paul Barry. Each multichain 0 = x_0 <= x_1 <= x_2 = 1 in such an n-interval corresponds to a closed walk described above by Paul Barry. More generally, each multichain 0 = x_0 <= x_1 <= ... <= x_k = 1 corresponds to a closed walk of length 2n on the k-dimensional hypercube, cf. A054879, A092812, A121822. - Geoffrey Critzer, Apr 21 2023

Write 0,1,2,... in a spiral; sequence gives numbers on one of 4 diagonals (see Example section).

For n>1 this is the Engel expansion of cosh(1), A118239. - Benoit Cloitre, Mar 03 2002

a(n) = A125199(n,n) for n>0. - Reinhard Zumkeller, Nov 24 2006

Central terms of the triangle in A195437: a(n+1) = A195437(2*n,n). - Reinhard Zumkeller, Nov 23 2011

For n>2, the terms represent the sums of those primitive Pythagorean triples with hypotenuse (H) one unit longer than the longest side (L), or H = L + 1. - Richard R. Forberg, Jun 09 2015

For n>1, a(n) is the perimeter of a Pythagorean triangle with an odd leg 2*n-1. - Agola Kisira Odero, Apr 26 2016

From Rigoberto Florez, Nov 07 2020 : (Start)

A338109(n)/a(n+1) is the Kirchhoff index of the join of the disjoint union of two complete graphs on n vertices with the empty graph on n+1 vertices.

Equivalently, the graph can be described as the graph on 3*n + 1 vertices with labels 0..3*n and with i and j adjacent iff iff i+j> 0 mod 3.

A338588(n)/a(n+1) is the Kirchhoff index of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.

Equivalently, the graph can be described as the graph on 3*n + 2 vertices with labels 0..3*n+1 and with i and j adjacent iff i+j> 0 mod 3.

These graphs are cographs. (End)

a(n), n>=1, is the number of paths of minimum length (length=2) from the origin to the cross polytope of size 2 in Z^n (column 2 in A371064). - Shel Kaphan, Mar 09 2024