cp's OEIS Frontend

b(0)=0, c(0)=1, b(i+1)=b(i)+c(i), c(i+1)=b(i+1)+b(i); then a(i) (the number in the sequence) is 2b(i)^2 if i is even, c(i)^2 if i is odd and b(n)=A000129(n) and c(n)=A001333(n). - Darin Stephenson (stephenson(AT)cs.hope.edu) and Alan Koch

For n > 1 gives solutions to A007913(2x) = A007913(x+1). - Benoit Cloitre, Apr 07 2002

If (X,X+1,Z) is a Pythagorean triple, then Z-X-1 and Z+X are in the sequence.

For n >= 2, a(n) gives exactly the positive integers m such that 1,2,...,m has a perfect median. The sequence of associated perfect medians is A001109. Let a_1,...,a_m be an (ordered) sequence of real numbers, then a term a_k is a perfect median if Sum_{j=1..k-1} a_j = Sum_{j=k+1..m} a_j. See Puzzle 1 in MSRI Emissary, Fall 2005. - Asher Auel, Jan 12 2006

This is the r=8 member of the r-family of sequences S_r(n) defined in A092184 where more information can be found.

Also, 1^3 + 2^3 + 3^3 + ... + a(n)^3 = k(n)^4 where k(n) is A001109. - Anton Vrba (antonvrba(AT)yahoo.com), Nov 18 2006

If T_x = y^2 is a triangular number which is also a square, the least number which is both triangular and square and greater than T_x is T_(3*x + 4*y + 1) = (2*x + 3*y + 1)^2 (W. Sierpiński 1961). - Richard Choulet, Apr 28 2009

If (a,b) is a solution of the Diophantine equation 0 + 1 + 2 + ... + x = y^2, then a or (a+1) is a perfect square. If (a,b) is a solution of the Diophantine equation 0 + 1 + 2 + ... + x = y^2, then a or a/8 is a perfect square. If (a,b) and (c,d) are two consecutive solutions of the Diophantine equation 0 + 1 + 2 + ... + x = y^2 with a < c, then a+b = c-d and ((d+b)^2, d^2-b^2) is a solution, too. If (a,b), (c,d) and (e,f) are three consecutive solutions of the Diophantine equation 0 + 1 + 2 + ... + x = y^2 with a < c < e, then (8*d^2, d*(f-b)) is a solution, too. - Mohamed Bouhamida, Aug 29 2009

If (p,q) and (r,s) are two consecutive solutions of the Diophantine equation 0 + 1 + 2 + ... + x = y^2 with p < r, then r = 3p + 4q + 1 and s = 2p + 3q + 1. - Mohamed Bouhamida, Sep 02 2009

Also numbers k such that (ceiling(sqrt(k*(k+1)/2)))^2 - k*(k+1)/2 = 0. - Ctibor O. Zizka, Nov 10 2009

From Lekraj Beedassy, Mar 04 2011: (Start)

Let x=a(n) be the index of the associated triangular number T_x=1+2+3+...+x and y=A001109(n) be the base of the associated perfect square S_y=y^2. Now using the identity S_y = T_y + T_{y-1}, the defining T_x = S_y may be rewritten as T_y = T_x - T_{y-1}, or 1+2+3+...+y = y+(y+1)+...+x. This solves the Strand Magazine House Number problem mentioned in A001109 in references from Poo-Sung Park and John C. Butcher. In a variant of the problem, solving the equation 1+3+5+...+(2*x+1) = (2*x+1)+(2*x+3)+...+(2*y-1) implies S_(x+1) = S_y - S_x, i.e., with (x,x+1,y) forming a Pythagorean triple, the solutions are given by pairs of x=A001652(n), y=A001653(n). (End)

If P = 8*n +- 1 is a prime, then P divides a((P-1)/2); e.g., 7 divides a(3) and 41 divides a(20). Also, if P = 8*n +- 3 is prime, then 4*P divides (a((P-1)/2) + a((P+1)/2) + 3). - Kenneth J Ramsey, Mar 05 2012

Starting at a(2), a(n) gives all the dimensions of Euclidean k-space in which the ratio of outer to inner Soddy hyperspheres' radii for k+1 identical kissing hyperspheres is rational. The formula for this ratio is (1+3k+2*sqrt(2k*(k+1)))/(k-1) where k is the dimension. So for a(3) = 49, the ratio is 6 in the 49th dimension. See comment for A010502. - Frank M Jackson, Feb 09 2013

Conjecture: For n>1 a(n) is the index of the first occurrence of -n in sequence A123737. - Vaclav Kotesovec, Jun 02 2015

For n=2*k, k>0, a(n) is divisible by 8 (deficient), so since all proper divisors of deficient numbers are deficient, then a(n) is deficient. For n=2*k+1, k>0, a(n) is odd. If a(n) is a prime number, it is deficient; otherwise a(n) has one or two distinct prime factors and is therefore deficient again. sigma(a(5)) = 1723 < 3362 = 2*a(5). In either case, a(n) is deficient. - Muniru A Asiru, Apr 14 2016

The squares of NSW numbers (A008843) interleaved with twice squares from A084703, where A008843(n) = A002315(n)^2 and A084703(n) = A001542(n)^2. Conjecture: Also numbers n such that sigma(n) = A000203(n) and sigma(n-th triangular number) = A074285(n) are both odd numbers. - Jaroslav Krizek, Aug 05 2016

For n > 0, numbers for which the number of odd divisors of both n and of n + 1 is odd. - Gionata Neri, Apr 30 2018

a(n) will be solutions to some (A000217(k) + A000217(k+1))/2. - Art Baker, Jul 16 2019

For n >= 2, a(n) is the base for which A058331(A001109(n)) is a length-3 repunit. Example: for n=2, A001109(2)=6 and A058331(6)=73 and 73 in base a(2)=8 is 111. See Grantham and Graves. - Michel Marcus, Sep 11 2020

The characteristic shape of the symmetric representation of a(n) consists in that in the main diagonal of the diagram the width is equal to zero.

So knowing this characteristic shape we can know if a number has middle divisors (or not) just by looking at the diagram, even ignoring the concept of middle divisors.

Therefore we can see a geometric pattern of the distribution of the numbers with no middle divisors in the stepped pyramid described in A245092.

For the definition of "width" see A249351.

All terms are even numbers.

The characteristic shape of the symmetric representation of sigma(A000217(n)) consists in that in the main diagonal of the diagram the smallest Dyck path has a valley and the largest Dyck path has a peak, or vice versa, the smallest Dyck path has a peak and the largest Dyck path has valley.

So knowing this characteristic shape we can know if a number is a triangular number (or not) just by looking at the diagram, even ignoring the concept of triangular number.

Therefore we can see a geometric pattern of the distribution of the triangular numbers in the stepped pyramid described in A245092.

T(n,k) is also the length of the k-th line segment of the largest Dyck path of the symmetric representation of sigma(A000217(n)), from the border to the center, hence the sum of the n-th row of triangle is equal to A000217(n).

T(n,k) is also the difference between the total number of partitions of all positive integers <= n-th triangular number into exactly k consecutive parts, and the total number of partitions of all positive integers <= n-th triangular number into exactly k + 1 consecutive parts.

This sequence is the intersection of A000217 and A006532.

The corresponding triangular indices are in A116990. - Michel Marcus, Mar 17 2015

The characteristic shape of the symmetric representation of a(n) consists in that in the main diagonal of the diagram the smallest Dyck path has a valley and the largest Dyck path has a peak.

So knowing this characteristic shape we can know if a number is an hexagonal number (or not) just by looking at the diagram, even ignoring the concept of hexagonal number.

Therefore we can see a geometric pattern of the distribution of the hexagonal numbers in the stepped pyramid described in A245092.

The characteristic shape of the symmetric representation of a(n) consists in that in the main diagonal of the diagram the smallest Dyck path has a peak and the largest Dyck path has a valley.

So knowing this characteristic shape we can know if a number is a second hexagonal number (or not) just by looking at the diagram, even ignoring the concept of second hexagonal number.

Therefore we can see a geometric pattern of the distribution of the second hexagonal numbers in the stepped pyramid described in A245092.

From Zak Seidov, Oct 19 2010: (Start)

A074285(n) = A000203(A000217(n)) = s^2.

Corresponding values of s begin: 1,2,12,24,42,72,96,216,240,192,240,288,336,456,504, 480,600,672,840,720,720,792,960,930,936,756,992,936,1008,1080,... (are most values of s multiples of 3?).

(End)

The characteristic shape of the symmetric representation of a(n) consists in that in the main diagonal of the diagram the width is >= 1.

Also the width on the main diagonal equals the number of middle divisors.

So knowing this characteristic shape we can know if a number has middle divisors (or not) and the number of them just by looking at the diagram, even ignoring the concept of middle divisors.

Therefore we can see a geometric pattern of the distribution of the numbers with middle divisors in the stepped pyramid described in A245092.

For the definition of "width" see A249351.