A077424 -id:A077424 - cp's OEIS frontend

A008310 Triangle of coefficients of Chebyshev polynomials T_n(x).

1, 1, -1, 2, -3, 4, 1, -8, 8, 5, -20, 16, -1, 18, -48, 32, -7, 56, -112, 64, 1, -32, 160, -256, 128, 9, -120, 432, -576, 256, -1, 50, -400, 1120, -1280, 512, -11, 220, -1232, 2816, -2816, 1024, 1, -72, 840, -3584, 6912, -6144, 2048, 13, -364, 2912, -9984, 16640, -13312, 4096

Offset: 0

N. J. A. Sloane

The row length sequence of this irregular array is A008619(n), n >= 0. Even or odd powers appear in increasing order starting with 1 or x for even or odd row numbers n, respectively. This is the standard triangle A053120 with 0 deleted. - Wolfdieter Lang, Aug 02 2014

Let T* denote the triangle obtained by replacing each number in this triangle by its absolute value. Then T* gives the coefficients for cos(nx) as a polynomial in cos x. - Clark Kimberling, Aug 04 2024

			Rows are: (1), (1), (-1,2), (-3,4), (1,-8,8), (5,-20,16) etc., since if c = cos(x): cos(0x) = 1, cos(1x) = 1c; cos(2x) = -1+2c^2; cos(3x) = -3c+4c^3, cos(4x) = 1-8c^2+8c^4, cos(5x) = 5c-20c^3+16c^5, etc.
From _Wolfdieter Lang_, Aug 02 2014: (Start)
This irregular triangle a(n,k) begins:
  n\k   0    1     2      3      4      5      6      7 ...
  0:    1
  1:    1
  2:   -1    2
  3:   -3    4
  4:    1   -8     8
  5:    5  -20    16
  6:   -1   18   -48     32
  7:   -7   56  -112     64
  8:    1  -32   160   -256    128
  9:    9 -120   432   -576    256
 10:   -1   50  -400   1120  -1280    512
 11:  -11  220 -1232   2816  -2816   1024
 12:    1  -72   840  -3584   6912  -6144   2048
 13:   13 -364  2912  -9984  16640 -13312   4096
 14:   -1   98 -1568   9408 -26880  39424 -28672   8192
 15:  -15  560 -6048  28800 -70400  92160 -61440  16384
  ...
T(4,x) = 1 - 8*x^2 + 8*x^4, T(5,x) = 5*x - 20*x^3 +16*x^5.
(End)

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 795.
E. A. Guilleman, Synthesis of Passive Networks, Wiley, 1957, p. 593.
Yaroslav Zolotaryuk, J. Chris Eilbeck, "Analytical approach to the Davydov-Scott theory with on-site potential", Physical Review B 63, p543402, Jan. 2001. The authors write, "Since the algebra of these is 'hyperbolic', contrary to the usual Chebyshev polynomials defined on the interval 0 <= x <= 1, we call the set of functions (21) the hyperbolic Chebyshev polynomials." (This refers to the triangle T* described in Comments.)

R. J. Mathar, Table of n, a(n) for n = 0..2600
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Renato Ferreira Pinto Jr. and Nathaniel Harms, Testing Support Size More Efficiently Than Learning Histograms, arXiv:2410.18915 [cs.DS], 2024. See p. 40.
D. Foata and G.-N. Han, Nombres de Fibonacci et polynomes orthogonaux
C. Lanczos, Applied Analysis (Annotated scans of selected pages)
I. Rivin, Growth in free groups (and other stories), arXiv:math/9911076 [math.CO], 1999.
Eric Weisstein's World of Mathematics, Chebyshev Polynomial of the First Kind.
Wikipedia, Chebyshev polynomials.
Index entries for sequences related to Chebyshev polynomials.

A039991 is a row reversed version, but has zeros which enable the triangle to be seen. Columns/diagonals are A011782, A001792, A001793, A001794, A006974, A006975, A006976 etc.
Reflection of A028297. Cf. A008312, A053112.
Row sums are one. Polynomial evaluations include A001075 (x=2), A001541 (x=3), A001091, A001079, A023038, A011943, A001081, A023039, A001085, A077422, A077424, A097308, A097310, A068203.
Cf. A053120.

A008310 := proc(n,m) local x ; coeftayl(simplify(ChebyshevT(n,x),'ChebyshevT'),x=0,m) ; end: i := 0 : for n from 0 to 100 do for m from n mod 2 to n by 2 do printf("%d %d ",i,A008310(n,m)) ; i := i+1 ; od ; od ; # R. J. Mathar, Apr 20 2007
# second Maple program:
b:= proc(n) b(n):= `if`(n<2, 1, expand(2*b(n-1)-x*b(n-2))) end:
T:= n-> (p-> (d-> seq(coeff(p, x, d-i), i=0..d))(degree(p)))(b(n)):
seq(T(n), n=0..15);  # Alois P. Heinz, Sep 04 2019

Flatten[{1, Table[CoefficientList[ChebyshevT[n, x], x], {n, 1, 13}]}]//DeleteCases[#, 0, Infinity]& (* or *) Flatten[{1, Table[Table[((-1)^k*2^(n-2 k-1)*n*Binomial[n-k, k])/(n-k), {k, Floor[n/2], 0, -1}], {n, 1, 13}]}] (* Eugeniy Sokol, Sep 04 2019 *)

a(n,m) = 2^(m-1) * n * (-1)^((n-m)/2) * ((n+m)/2-1)! / (((n-m)/2)! * m!) if n>0. - R. J. Mathar, Apr 20 2007
From Paul Weisenhorn, Oct 02 2019: (Start)
T_n(x) = 2*x*T_(n-1)(x) - T_(n-2)(x), T_0(x) = 1, T_1(x) = x.
T_n(x) = ((x+sqrt(x^2-1))^n + (x-sqrt(x^2-1))^n)/2. (End)
From Peter Bala, Aug 15 2022: (Start)
T(n,x) = [z^n] ( z*x + sqrt(1 + z^2*(x^2 - 1)) )^n.
Sum_{k = 0..2*n} binomial(2*n,k)*T(k,x) = (2^n)*(1 + x)^n*T(n,x).
exp( Sum_{n >= 1} T(n,x)*t^n/n ) = Sum_{n >= 0} P(n,x)*t^n, where P(n,x) denotes the n-th Legendre polynomial. (End)

Additional comments and more terms from Henry Bottomley, Dec 13 2000

Edited: Corrected Cf. A039991 statement. Cf. A053120 added. - Wolfdieter Lang, Aug 06 2014

A077423 Chebyshev sequence U(n,12)=S(n,24) with Diophantine property.

Original entry on oeis.org

1, 24, 575, 13776, 330049, 7907400, 189447551, 4538833824, 108742564225, 2605282707576, 62418042417599, 1495427735314800, 35827847605137601, 858372914787987624, 20565122107306565375, 492704557660569581376

Offset: 0

Wolfdieter Lang, Nov 29 2002

b(n)^2 - 143*a(n)^2 = 1 with the companion sequence b(n)=A077424(n+1).
For positive n, a(n) equals the permanent of the n X n tridiagonal matrix with 24's along the main diagonal, and i's along the subdiagonal and the superdiagonal (i is the imaginary unit). - John M. Campbell, Jul 08 2011
For n>=1, a(n) equals the number of 01-avoiding words of length n-1 on alphabet {0,1,...,23}. - Milan Janjic, Jan 25 2015

Indranil Ghosh, Table of n, a(n) for n = 0..723
Tanya Khovanova, Recursive Sequences
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (24,-1).

Chebyshev sequence U(n, m): A000027 (m=1), A001353 (m=2), A001109 (m=3), A001090 (m=4), A004189 (m=5), A004191 (m=6), A007655 (m=7), A077912 (m=8), A049660 (m=9), A075843 (m=10), A077421 (m=11), this sequence (m=12), A097309 (m=13), A097311 (m=14), A097313 (m=15), A029548 (m=16), A029547 (m=17), A144128 (m=18), A078987 (m=19), A097316 (m=33).

Cf. A323182.

a:=[1,24];; for n in [3..20] do a[n]:=24*a[n-1]-a[n-2]; od; a; # G. C. Greubel, Dec 22 2019

R:=PowerSeriesRing(Integers(), 20); Coefficients(R!( 1/(1-24*x+x^2) )); // G. C. Greubel, Dec 22 2019

seq( simplify(ChebyshevU(n, 12)), n=0..20); # G. C. Greubel, Dec 22 2019

Table[GegenbauerC[n, 1, 12], {n,0,20}] (* Vladimir Joseph Stephan Orlovsky, Sep 11 2008 *)
ChebyshevU[Range[21] -1, 12] (* G. C. Greubel, Dec 22 2019 *)

vector(21, n, polchebyshev(n-1, 2, 12) ) \\ G. C. Greubel, Dec 22 2019

[lucas_number1(n,24,1) for n in range(1,20)] # Zerinvary Lajos, Jun 25 2008

a(n) = 24*a(n-1) - a(n-2), a(-1) = 0, a(0) = 1.
a(n) = S(n, 24) with S(n, x) := U(n, x/2) Chebyshev's polynomials of the 2nd kind. See A049310.
a(n) = (ap^(n+1) - am^(n+1))/(ap - am) with ap= 12+sqrt(143) and am = 12-sqrt(143).
a(n) = Sum_{k=0..floor(n/2)} (-1)^k*binomial(n-k, k)*24^(n-2*k).
a(n) = sqrt((A077424(n+1)^2 - 1)/143).
G.f.: 1/(1-24*x+x^2). - Philippe Deléham, Nov 18 2008
a(n) = Sum_{k=0..n} A101950(n,k)*23^k. - Philippe Deléham, Feb 10 2012
Product {n >= 0} (1 + 1/a(n)) = 1/11*(11 + sqrt(143)). - Peter Bala, Dec 23 2012
Product {n >= 1} (1 - 1/a(n)) = 1/24*(11 + sqrt(143)). - Peter Bala, Dec 23 2012

A322836 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Chebyshev polynomial of the first kind T_{n}(x), evaluated at x=k.

Original entry on oeis.org

1, 1, 0, 1, 1, -1, 1, 2, 1, 0, 1, 3, 7, 1, 1, 1, 4, 17, 26, 1, 0, 1, 5, 31, 99, 97, 1, -1, 1, 6, 49, 244, 577, 362, 1, 0, 1, 7, 71, 485, 1921, 3363, 1351, 1, 1, 1, 8, 97, 846, 4801, 15124, 19601, 5042, 1, 0, 1, 9, 127, 1351, 10081, 47525, 119071, 114243, 18817, 1, -1

Offset: 0

Seiichi Manyama, Dec 28 2018

			Square array begins:
   1, 1,    1,     1,      1,      1,       1, ...
   0, 1,    2,     3,      4,      5,       6, ...
  -1, 1,    7,    17,     31,     49,      71, ...
   0, 1,   26,    99,    244,    485,     846, ...
   1, 1,   97,   577,   1921,   4801,   10081, ...
   0, 1,  362,  3363,  15124,  47525,  120126, ...
  -1, 1, 1351, 19601, 119071, 470449, 1431431, ...

Seiichi Manyama, Antidiagonals n = 0..139, flattened
Wikipedia, Chebyshev polynomials.
Index entries for sequences related to Chebyshev polynomials.

Mirror of A101124.
Columns 0-20 give A056594, A000012, A001075, A001541, A001091, A001079, A023038, A011943(n+1), A001081, A023039, A001085, A077422, A077424, A097308, A097310, A068203, A322888, A056771, A322889, A078986, A322890.
Rows 0-10 give A000012, A001477, A056220, A144129, A144130, A243131, A243132, A243133, A243134, A243135, A243136.
Main diagonal gives A115066.
Cf. A323182 (Chebyshev polynomial of the second kind).

Table[ChebyshevT[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Amiram Eldar, Dec 28 2018 *)

T(n,k) = polchebyshev(n,1,k);
matrix(7, 7, n, k, T(n-1,k-1)) \\ Michel Marcus, Dec 28 2018

T(n, k) = round(cos(n*acos(k)));\\ Seiichi Manyama, Mar 05 2021

T(n, k) = if(n==0, 1, n*sum(j=0, n, (2*k-2)^j*binomial(n+j, 2*j)/(n+j))); \\ Seiichi Manyama, Mar 05 2021

A(0,k) = 1, A(1,k) = k and A(n,k) = 2 * k * A(n-1,k) - A(n-2,k) for n > 1.
A(n,k) = cos(n*arccos(k)). - Seiichi Manyama, Mar 05 2021
A(n,k) = n * Sum_{j=0..n} (2*k-2)^j * binomial(n+j,2*j)/(n+j) for n > 0. - Seiichi Manyama, Mar 05 2021

A090732 a(n) = 24a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 24.

Original entry on oeis.org

2, 24, 574, 13752, 329474, 7893624, 189117502, 4530926424, 108553116674, 2600743873752, 62309299853374, 1492822452607224, 35765429562720002, 856877487052672824, 20529294259701427774, 491846184745781593752

Offset: 0

Nikolay V. Kosinov (kosinov(AT)unitron.com.ua), Jan 18 2004

Indranil Ghosh, Table of n, a(n) for n = 0..723
Tanya Khovanova, Recursive Sequences
Index entries for recurrences a(n) = k*a(n - 1) +/- a(n - 2)
Index entries for linear recurrences with constant coefficients, signature (24,-1).

Cf. A056949, A077424.

a[0] = 2; a[1] = 24; a[n_] := 24a[n - 1] - a[n - 2]; Table[ a[n], {n, 0, 15}] (* Robert G. Wilson v, Jan 30 2004 *)
LinearRecurrence[{24,-1},{2,24},30] (* Harvey P. Dale, Sep 19 2011 *)

a(n)=([0,1;-1,24]^n*[2;24])[1,1] \\ Charles R Greathouse IV, Feb 07 2017

[lucas_number2(n,24,1) for n in range(0,20)] # Zerinvary Lajos, Jun 26 2008

a(n) = p^n + q^n, where p = 12 + sqrt(143) and q = 12 - sqrt(143). - Tanya Khovanova, Feb 06 2007
G.f.: (2-24*x)/(1-24*x+x^2). - Philippe Deléham, Nov 02 2008
a(n)=2*A077424(n). - R. J. Mathar, Sep 27 2014

A118894 Numbers m such that the Pell equation x^2-m*y^2=1 has fundamental solution with x even.

Original entry on oeis.org

3, 7, 11, 15, 19, 23, 27, 31, 35, 43, 47, 51, 59, 63, 67, 71, 75, 79, 83, 87, 91, 99, 103, 107, 115, 119, 123, 127, 131, 135, 139, 143, 151, 159, 163, 167, 171, 175, 179, 187, 191, 195, 199, 211, 215, 219, 223, 227, 231, 235, 239, 243, 247, 251, 255, 263, 267

Offset: 1

T. D. Noe, May 04 2006

nonn

Numbers m such that A002350(m) is even. These m can be used to generate consecutive odd powerful numbers, as in A076445. As shown by Lang, the solution of Pell's equation is greatly simplified by Chebyshev polynomials of the first kind T(n,x), which is illustrated in A001075 for the case m=3. In that case, the solutions are x=T(n,2), for integer n>0. For any m in this sequence, let E(k)=T(m+2mk,A002350(m)). Then E(k)-1 and E(k)+1 are consecutive odd powerful numbers for k=0,1,2,...

Wolfdieter Lang, Chebyshev Polynomials and Certain Quadratic Diophantine Equations
H. W. Lenstra Jr., Solving the Pell equation, Notices AMS, 49 (2002), 182-192.

Cf. A001075, A001091, A023038, A001081, A001085, A077424, A097310 (x solutions for m=3, 15, 35, 63, 99, 143, 195).

cp's OEIS Frontend

A008310 Triangle of coefficients of Chebyshev polynomials T_n(x).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A077423 Chebyshev sequence U(n,12)=S(n,24) with Diophantine property.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A322836 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where A(n,k) is Chebyshev polynomial of the first kind T_{n}(x), evaluated at x=k.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Formula

A090732 a(n) = 24a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 24.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Sage

Formula

A118894 Numbers m such that the Pell equation x^2-m*y^2=1 has fundamental solution with x even.

Views

Author

Keywords

Comments

Links

Crossrefs