cp's OEIS Frontend

(1) a(n) = sum of second string of n triangular numbers - sum of first n triangular numbers, or the 2n-th partial sum of triangular numbers (A000217) - the n-th partial sum of triangular numbers (A000217). The same for natural numbers gives squares. (2) a(n) = (n-th triangular number)*(the n-th even number) = n(n+1)/2 * (2n). - Amarnath Murthy, Nov 05 2002

Let M(n) be the n X n matrix m(i,j)=1/(i+j+x), let P(n,x) = (Product_{i=0..n-1} i!^2)/det(M(n)). Then P(n,x) is a polynomial with integer coefficients of degree n^2 and a(n) is the coefficient of x^(n^2-1). - Benoit Cloitre, Jan 15 2003

Y values of solutions of the equation: (X-Y)^3-X*Y=0. X values are a(n)=n*(n+1)^2 (see A045991) - Mohamed Bouhamida, May 09 2006

a(2d-1) is the number of self-avoiding walk of length 3 in the d-dimensional hypercubic lattice. - Michael Somos, Sep 06 2006

a(n) mod 10 is periodic 5: repeat [0, 2, 2, 6, 0]. - Mohamed Bouhamida, Sep 05 2009

This sequence is related to A005449 by a(n) = n*A005449(n)-sum(A005449(i), i=0..n-1), and this is the case d=3 in the identity n^2*(d*n+d-2)/2 - Sum_{k=0..n-1} k*(d*k+d-2)/2 = n*(n+d)*(2*d*n+d-3)/6. - Bruno Berselli, Nov 18 2010

Using (n, n+1) to generate a primitive Pythagorean triangle, the sides will be 2*n+1, 2*(n^2+n), and 2*n^2+2*n+1. Inscribing the largest rectangle with integral sides will have sides of length n and n^2+n. Side n is collinear to side 2*n+1 of the triangle and side n^2+n is collinear to side 2*(n^2+n) of the triangle. The areas of theses rectangles are a(n). - J. M. Bergot, Sep 22 2011

a(n+1) is the sum of n-th row of the triangle in A195437. - Reinhard Zumkeller, Nov 23 2011

Partial sums of A049450. - Omar E. Pol, Jan 12 2013

From Jon Perry, May 11 2013: (Start)

Define a 'stable brick triangle' as:

-----

| c |

---------

| a | | b |

----------

with a, b, c > 0 and c <= a + b. This can be visualized as two bricks with a third brick on top. The third brick can only be as strong as a+b, otherwise the wall collapses - for example, (1,2,4) is unstable.

a(n) gives the number of stable brick triangles that can be formed if the two supporting bricks are 1 <= a <= n and 1 <= b <= n: a(n) = Sum_{a=1..n} Sum_{b=1..n} Sum_c 1 = n^3 + n^2 as given in the Adamchuk formula.

So for i=j=n=2 we have 4:

1 2 3 4

2 2 2 2 2 2 2 2

For example, n=2 gives 2 from [a=1,b=1], 3 from both [a=1,b=2] and [a=2,b=1] and 4 from [a=2,b=2] so a(2) = 2 + 3 + 3 + 4 = 12. (End)

Define the infinite square array m(n,k) by m(n,k) = (n-k)^2 if n >= k >= 0 and by m(n,k) = (k+n)*(k-n) if 0 <= n <= k. This contains A120070 below the diagonal. Then a(n) = Sum_{k=0..n} m(n,k) + Sum_{r=0..n} m(r,n), the "hook sum" of the terms to the left of m(n,n) and above m(n,n) with irrelevant (vanishing) terms on the diagonal. - J. M. Bergot, Aug 16 2013

a(n) is the sum of all pairs with repetition drawn from the set of odd numbers 2*n-3. This is similar to A027480 but using the odd integers instead. Example using n=3 gives the odd numbers 1,3,5: 1+1, 1+3, 1+5, 3+3, 3+5,5+5 having a total of 36=a(3). - J. M. Bergot, Apr 05 2016

a(n) is the first Zagreb index of the complete graph K[n+1]. The first Zagreb index of a simple connected graph is the sum of the squared degrees of its vertices. Alternately, it is the sum of the degree sums d(i)+d(j) over all edges ij of the graph. - Emeric Deutsch, Nov 07 2016

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

a(n) = the area of a trapezoid with vertices at (n-1,n), (n,n-1), ((n-1)^2,n^2), and (n^2,(n-1)^2). - J. M. Bergot, Mar 23 2014

For n > 3, also the detour index of the (n-1)-helm graph. - Eric W. Weisstein, Dec 16 2017

a(n-3) is the maximum sigma irregularity over all maximal 2-degenerate graphs with n vertices. The extremal graphs are 2-stars (K_2 joined to n-2 independent vertices). (The sigma irregularity of a graph is the sum of the squares of the differences between the degrees over all edges of the graph.) - Allan Bickle, Jun 14 2023

A number square contains all numbers from 1 to n^2 without duplicates.

The 2 X 2 subset diagonal sums in these squares are equal, though those sums may differ.

When the single unit 2 X 2 subset is required to have diagonals with equal sums every rectangle within the generated square will have diagonals with equal sums.

Reversible squares are a previously defined entity. They require all symmetrically opposite pairs in each row and column to have the same sum in addition to the diagonal constraints noted above.

It is an embarrassment that no one has enumerated the order 6 magic squares. Richard C. Schroeppel provided the exact count for the order 5 magic squares in 1973 - now more than 40 years ago.

The sigma irregularity of a graph is the sum of the squares of the differences between the degrees over all edges of the graph.

This generalizes the 2D case, where an n X n grid has (n-1)^2 tiles, and the 3D case, where an n X n X n cube has 3n^3 - 6n^2 + 3n tiles.

In 4D, the hypercube is interpreted inductively as n 3D cubes arranged in a row along the fourth axis ("moving-cube" model).

Equivalently, this sequence counts the 2X2 tiles in the 3D projection ("shadow") of the 4D hypercube.