0,2

Consider all Pythagorean triples (X,Y,Z=Y+1) ordered by increasing Z; sequence gives Y values. X values are 1, 3, 5, 7, 9, ... (A005408), Z values are A001844.

In the triple (X, Y, Z) we have X^2=Y+Z. Actually, the triple is given by {x, (x^2 -+ 1)/2}, where x runs over the odd numbers (A005408), and x^2 over the odd squares (A016754). - Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 11 2004

a(n) = number of edges in (n+1) X (n+1) square grid with all horizontal and vertical segments filled in - Asher Auel (asher.auel(AT)reed.edu) Jan 12, 2000.

a(n) is the only number satisfying an inequality related to zeta(2) and zeta(3): sum(i>a(n)+1,1/i^2) < sum(i>n,1/i^3) < sum(i>a(n),1/i^2). - Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 02 2001

Number of right triangles made from vertices of a regular n-gon when n is even - Sen-Peng You (giawgwan(AT)single.url.com.tw), Apr 05 2001

Number of ways to change two non-identical letters in the word aabbccdd..., where there are n type of letters. - Zerinvary Lajos (zlaja(AT)freemail.hu), Feb 15 2005

a(n) is the number of (n-1)-dimensional sides of an (n+1)-dimensional hypercube (e.g. squares have 4 corners, cubes have 12 edges, etc.). - Freek van Walderveen (freek_is(AT)vanwal.nl), Nov 11 2005

Comments from Nikolaos Diamantis (nikos7am(AT)yahoo.com), May 23 2006: "Consider a triangle, a pentagon, an eptagon, ..., a k-gon where k is odd. We label a triangle with n=1, a pentagon with n=2, .., a k-gon with n = floor(k/2). Imagine every player standing on every vertex of the k-gon.

"Initially there are 2 frisbees on two neighboring players. Every time they throw the frisbee to their neighbor with equal probability. Then a(n) gives the average number of steps needed so that the frisbees meet.

"I verified it by simulating the processes with a computer program. For example a(2) = 12 because in a pentagon that's the expected number of trials we need to perform. That is an exercise in Concrete Mathematics and it can be done using generating functions."

First difference of a(n) is 4n = A008586(n). Any entry k of the sequence is followed by k + 2*{1 + sqrt(2k + 1)}. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jun 04 2006

A diagonal of A059056. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 18 2007

If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n-1) is equal to the number of 2-subsets of X containing none of X_i, (i=1,...n). - Milan R. Janjic (agnus(AT)blic.net), Jul 16 2007

Sequence allows us to find X values of the equation: 2*X^3 + X^2 = Y^2. To find Y values: b(n)=2n(n+1)(2n+1). - Mohamed Bouhamida (bhmd95(AT)yahoo.fr), Nov 06 2007

Number of (n+1)-permutations of 3 objects u,v,w, with repetition allowed, containing n-1 u's. Example: a(1)=4 because we have vv, vw, wv, and ww; a(2)=12 because we can place u in each of the previous four 2-permutations either in front, or in the middle, or at the end. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 27 2007

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 3.

A. H. Beiler, Recreations in the Theory of Numbers. New York: Dover, p. 125, 1964.

Ronald L. Graham, D. E. Knuth and Oren Patashnik, Concrete Mathematics, Reading, Massachusetts: Addison-Wesley, 1994.

Milan Janjic, Two Enumerative Functions

Ron Knott, Pythagorean Triples and Online Calculators

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Aztec Diamond

Eric Weisstein's World of Mathematics, Gear Graph

Eric Weisstein's World of Mathematics, Hamiltonian Path

a(n) = 2*A002378(n) = 4*A000217(n). - Lekraj Beedassy (blekraj(AT)yahoo.com), May 25 2004

a(n) = C(2n, 2) - n = 4*C(n, 2) - Zerinvary Lajos (zlaja(AT)freemail.hu), Feb 15 2005

a(n)=A028896-A002378; a(n)=A124080-A028896; a(n)=A049598-A033996. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 06 2007

a(7)=112 because 112 = 2*7*(7+1).

The first few triples are (1,0,1), (3,4,5), (5,12,13), (7,24,25),...

a:=n->sum(n+2*j, j=0..n): seq(a(n), n=0..46); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 29 2007

Table[2n(n + 1), {n, 0, 50}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 03 2006

Cf. A045943, A028895.

Cf. A002943, A054000, A000330, A007290.

Main diagonal of array in A001477.

a(n)=A100345(n+1, n-1) for n>0.

Equals A033996/2

Cf. A002378, A033996, A124080, A028896, A049598.

Cf. A005563.

Adjacent sequences: A046089 A046090 A046091 this_sequence A046093 A046094 A046095

Sequence in context: A081937 A115228 A088557 this_sequence A008241 A008216 A008074

nonn,easy,nice

njas, Eric Weisstein (eric(AT)weisstein.com)