cp's OEIS Frontend

The equation "(k^2 - 8)/2 is a square" is a version of the generalized Pell Equation "x^2 - D*y^2 = C".

a(n)^2 - 2*A077444(n) = 8.

From Wolfdieter Lang, Jan 18 2013: (Start)

4*(1-z)/(1-6*z+z^2) = Sum_{n>=0} a(n+1)*z^n is the formal power series for tan(4*x)/tan(x) if one lets

z = (tan(x))^2. For the numerator and denominator of this o.g.f. see A034867 and A034839, respectively. Convergence holds for 0 <= z < 3 - 2*sqrt(2), approximately 0.1715728753. This means for |x| < Pi/8, approximately 0.3926990818.

See also the o.g.f. given by Johannes W. Meijer, Aug 01 2010, in the formula section of A001653 = (this sequence)/4.

(End)

Positive values of x (or y) satisfying x^2 - 6*x*y + y^2 + 64 = 0. - Colin Barker, Feb 13 2014

Riordan array (x/(1-x)^2, x^2/(1-x)^2).

Mirror image of triangle in A119900.

A203322*A130595 as infinite lower triangular matrices. - Philippe Deléham, Jan 05 2011

From Gus Wiseman, Jul 07 2025: (Start)

Also the number of subsets of {1..n} containing n with k maximal runs (sequences of consecutive elements increasing by 1). For example, row n = 5 counts the following subsets:

{5} {1,5} {1,3,5}

{4,5} {2,5}

{3,4,5} {3,5}

{2,3,4,5} {1,2,5}

{1,2,3,4,5} {1,4,5}

{2,3,5}

{2,4,5}

{1,2,3,5}

{1,2,4,5}

{1,3,4,5}

For anti-runs instead of runs we have A053538.

Without requiring n see A210039, A202023, reverse A098158, A109446.

(End)

Row n contains ceiling(n/2) terms. Row sums yield the Pell numbers (A000129). Column 1 yields A007290.

Eigenvector equals A118397, so that A118397(n) = Sum_{k=0..[n/2]} T(n+1,k)*A118397(k) for n >= 0. - Paul D. Hanna, May 08 2006

Essentially a triangle, read by rows, given by (2, -1/2, 1/2, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Dec 12 2011

Subtriangle of the triangle given by (1, 1, -1, 1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 0, 2, -2, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Apr 07 2012

Comment from Peter Bala (Dec 06 2011): "Let P denote Pascal's triangle A070318 and put M = 1/2*(P-P^-1). M is A162590 (see also A131047). Then the first column of (I-t*M)^-1 (apart from the initial 1) lists the row polynomials for" A196776(n,k), which gives the number of ordered partitions of an n set into k odd-sized blocks. - Peter Luschny, Dec 06 2011

The n-th row of the triangle is formed by multiplying by 2^(n-1) the elements of the first row of the limit as k approaches infinity of the stochastic matrix P^(2k-1) where P is the stochastic matrix associated with the Ehrenfest model with n balls. The elements of a stochastic matrix P give the probability of arriving in a state j given the previous state i. In particular the sum of every row of the matrix must be 1, and so the sum of the terms in the n-th row of this triangle is 2^(n-1). Furthermore, by the properties of Markov chains, we can interpret P^(2k) as the (2k)-step transition matrix of the Ehrenfest model and its limit exists and it is again a stochastic matrix. The rows of the triangle divided by 2^(n-1) are the even rows (second, fourth, ...) and the odd rows (first, third, ...) of the limit matrix P^(2k). - Luca Onnis, Oct 29 2023

Sum of consecutive pairs of elements of A025192.

The alternating sign sequence with g.f. (1-x^2)/(1+3x) gives the diagonal sums of A110168. - Paul Barry, Jul 14 2005

Let M = an infinite lower triangular matrix with the odd integers (1,3,5,...) in every column, with the leftmost column shifted up one row. Then A080923 = lim_{n->inf} M^n. - Gary W. Adamson, Feb 18 2010

a(n+1), n >= 0, with o.g.f. ((1-x^2)/(1-3*x)-1)/x = (3-x)/(1-3*x) provides the coefficients in the formal power series for tan(3*x)/tan(x) = (3-z)/(1-3*z) = Sum_{n>=0} a(n+1)*z^n, with z = tan(x)^2. Convergence holds for 0 <= z < 1/3, i.e., |x| < Pi/6, approximately 0.5235987758. For the numerator and denominator of this o.g.f. see A034867 and A034839, respectively. - Wolfdieter Lang, Jan 18 2013

Riordan array (1/(1-x), x^2/(1-x)^2).

A skewed version of triangular array A085478.

Mirror image of triangle in A098158.

Sum_{k, 0<=k<=n} T(n,k)*x^k = A138229(n), A006495(n), A138230(n),A087455(n), A146559(n), A000012(n), A011782(n), A001333(n),A026150(n), A046717(n), A084057(n), A002533(n), A083098(n),A084058(n), A003665(n), A002535(n), A133294(n), A090042(n),A125816(n), A133343(n), A133345(n), A120612(n), A133356(n), A125818(n) for x = -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18 respectively.

Sum_{k, 0<=k<=n} T(n,k)*x^(n-k) = A009116(n), A000007(n), A011782(n), A006012(n), A083881(n), A081335(n), A090139(n), A145301(n), A145302(n), A145303(n), A143079(n) for x = -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 respectively.

From Gus Wiseman, Jul 08 2025: (Start)

After the first row this is also the number of subsets of {1..n-1} with k maximal runs (sequences of consecutive elements increasing by 1) for k = 0..n. For example, row n = 5 counts the following subsets:

{} {1} {1,3} . . .

{2} {1,4}

{3} {2,4}

{4} {1,2,4}

{1,2} {1,3,4}

{2,3}

{3,4}

{1,2,3}

{2,3,4}

{1,2,3,4}

Requiring n-1 gives A202064.

For anti-runs instead of runs we have A384893.

(End)