cp's OEIS Frontend

This is a table related to the square array of nonnegative integers, A001477. Each row k contains the positive argument of the largest triangular number equal to or less than 14*k in column 0 and a corresponding 2nd-order recursive sequence G(k) beginning at position a(k,1). Each term G(i) is the same as a(k,i+1). If the product 14*k appears in row "r" of the square array A001477, then the product of adjacent terms G(i)*G(i+1), if greater than (r^2 + 3*r - 2)/2, is always in row "r" of table A001477. If the product is less than (r^2 +3*r -2)/2, then the product less r would be a triangular number, i.e., still lie in the same row assumed to contain all numbers n that equal a triangular number + r. For example, 3 is a triangular number and appears in row 0 of A001477, but if the rows could take negative indices, A001477(2,-1) would be a 3 so 3 can be said to also lie in row 2. See A182102 for a table of the arguments of the triangular numbers G(i)*G(i+1) - r.

A property of this table is that a(k+1,i)-a(k,i) directly depends on the value of a(k+1,0)-a(k,0) in the same manner regardless of the value of k. For instance, if a(k+1,0) - a(k,0) = 1 then a(k+1,i+1) - a(k,i+1) equals A182435(i) for all i. Also, for i>0, A143608(i) divides a(k+1,i+1)-a(k,i+1) for all k.

It is noted that the difference between adjacent rows of the respective elements, depends on the difference between the elements of column 0 in the respective rows. It is apparent that the series of differences corresponding to a difference of d in column 0, i.e. A(k+1,0) - A(k,0) = d, is defined as follows: D(0) = d, D(1) = 4 - d, D(n) = 6*D(n-1) - D(n-2) -8*d + 4. The sequence of differences corresponding to a difference of -1 or 0 in column 0 form related series A182191 and A182190.

The Mathematica program below first calculates an array containing only the first four nonnegative triangular arguments P of each row then changes at most 2 of the arguments to the corresponding negative value, N = -P -1 in order to obtain the relation a(k,i) -7*a(k,i+1) + 7*a(k,i+2) - a(k,i+3) = 0, then chooses the appropriate argument to continue this relationship with the remainder of the row. In this way, the sequence is finally determined. Thus in this table a few 0's have been changed to -1.

The triangular product a(k,i)*(a(k,i)+1)/2 + A002262(14*k) for i<4 = the product of adjacent terms G(k,i+1)*G(k,i+2) where G is table A182441. The remainder of each row is padded with zeros. However, if for i > 3, a(k,i) were set to equal 7*a(k,i-1) - 7*a(k,i-2) + a(k,i-3) then the relation above would not be limited to i < 4.

Also, it is noted that the difference between adjacent rows of the respective elements, depends on the difference between the elements of column 0 in the respective rows. In the Mathematica program below, m is set to 14; however, regardless of it value of m, it is apparent that the series of differences corresponding to a difference of d in column 0, i.e. A(k+1,0) - A(k,0) = d, is defined as follows: D(0) = d, D(1) = - d, D(n) = 6*D(n-1) - D(n-2) -8*d + 4. The sequence of differences corresponding to a difference d of -1 is series A182193.

The Mathematica program below basically first computes only the nonnegative triangular arguments P. Then it changes at most two of the arguments P in each row k to the corresponding negative value, N = -P -1, in order to obtain the relation a(k,3) = a(k,0) - 7*a(k,1) + 7*a(k,2).