cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 15 results. Next

A115066 Chebyshev polynomial of the first kind T(n,x), evaluated at x=n.

Original entry on oeis.org

1, 1, 7, 99, 1921, 47525, 1431431, 50843527, 2081028097, 96450076809, 4993116004999, 285573847759211, 17882714781360001, 1216895030905226413, 89415396036432386311, 7055673735003659189775, 595077930963909484707841, 53421565080956452077519377
Offset: 0

Views

Author

Roger L. Bagula, Mar 01 2006

Keywords

Examples

			a(3) = 99 because T[3, x] = 4x^3 - 3x and T[3, 3] = 4*3^3 - 3*3 = 99.
		

References

  • G. Freud, Orthogonal Polynomials, Pergamon Press, Oxford, 1966, p. 35.
  • M. Rosenblum and J. Rovnyak, Hardy Classes and Operator Theory, Dover, New York, 1985, page 18.
  • G. Szego, Orthogonal polynomials, Amer. Math. Soc., Providence, 1939, p. 29.

Crossrefs

Programs

  • Maple
    with(orthopoly): seq(T(n,n),n=0..17);
  • Mathematica
    Table[ChebyshevT[n, n], {n, 0, 17}] (* Arkadiusz Wesolowski, Nov 17 2012 *)
  • PARI
    A115066(n)=cos(n*acos(n))  \\ M. F. Hasler, Apr 06 2012
    
  • PARI
    a(n) = polchebyshev(n, 1, n); \\ Seiichi Manyama, Dec 28 2018
    
  • PARI
    a(n) = if(n==0, 1, n*sum(k=0, n, (2*n-2)^k*binomial(n+k, 2*k)/(n+k))); \\ Seiichi Manyama, Mar 05 2021

Formula

a(n) = cos(n*arccos(n)).
a(n) ~ 2^(n-1) * n^n. - Vaclav Kotesovec, Jan 19 2019
a(n) = (A323118(n) - A107995(n-2))/2 for n > 1. - Seiichi Manyama, Mar 05 2021
a(n) = n * Sum_{k=0..n} (2*n-2)^k * binomial(n+k,2*k)/(n+k) for n > 0. - Seiichi Manyama, Mar 05 2021
It appears that a(2*n+1) == 0 (mod (2*n+1)^2) and 2*a(4*n+2) == -2 (mod (4*n+2)^4), while for k > 1, 2*a(2^k*(2*n+1)) == 2 (mod (2^k*(2*n+1))^4). - Peter Bala, Feb 01 2022

Extensions

Edited by N. J. A. Sloane, Apr 05 2006

A173128 a(n) = cosh(2*n*arcsinh(n)).

Original entry on oeis.org

1, 3, 161, 27379, 9478657, 5517751251, 4841332221601, 5964153172084899, 9814664424981012481, 20791777842234580902499, 55106605639755476546020001, 178627672869645203363556318483, 695165908550906808156689590141441
Offset: 0

Views

Author

Artur Jasinski, Feb 10 2010

Keywords

Crossrefs

Programs

  • Maple
    seq(expand( (1/2)*((n + sqrt(n^2 + 1))^(2*n) + (n - sqrt(n^2 + 1))^(2*n))), n=0..30); # Robert Israel, Apr 05 2016
  • Mathematica
    Round[Table[Cosh[2 n ArcSinh[n]], {n, 0, 20}]] (* Artur Jasinski *)
    Round[Table[1/2 (x - Sqrt[1 + x^2])^(2 x) + 1/2 (x + Sqrt[1 + x^2])^(2 x), {x, 0, 20}]] (* Artur Jasinski, Feb 14 2010 *)
  • PARI
    {a(n) = sum(k=0, n, binomial(2*n, 2*k)*(n^2+1)^(n-k)*n^(2*k))} \\ Seiichi Manyama, Dec 27 2018
    
  • PARI
    {a(n) = polchebyshev(n, 1, 2*n^2+1)} \\ Seiichi Manyama, Dec 29 2018

Formula

a(n) = (1/2)*((n + sqrt(n^2 + 1))^(2*n) + (n - sqrt(n^2 + 1))^(2*n)). - Artur Jasinski, Feb 14 2010, corrected by Vaclav Kotesovec, Apr 05 2016
a(n) = Sum_{k=0..n} binomial(2*n,2*k)*(n^2+1)^(n-k)*n^(2*k). - Seiichi Manyama, Dec 27 2018
a(n) = T_{n}(2*n^2+1) where T_{n}(x) is a Chebyshev polynomial of the first kind. - Seiichi Manyama, Dec 29 2018

A188644 Array of (k^n + k^(-n))/2 where k = (sqrt(x^2-1) + x)^2 for integers x >= 1.

Original entry on oeis.org

1, 1, 1, 1, 7, 1, 1, 97, 17, 1, 1, 1351, 577, 31, 1, 1, 18817, 19601, 1921, 49, 1, 1, 262087, 665857, 119071, 4801, 71, 1, 1, 3650401, 22619537, 7380481, 470449, 10081, 97, 1, 1, 50843527, 768398401, 457470751, 46099201, 1431431, 18817, 127, 1
Offset: 0

Views

Author

Charles L. Hohn, Apr 06 2011

Keywords

Comments

Conjecture: Given the function f(x,y) = (sqrt(x^2+y) + x)^2 and constant k=f(x,y), then for all integers x >= 1 and y=[+-]1, k may be irrational, but (k^n + k^(-n))/2 always produces integer sequences; y=-1 results shown here; y=1 results are A188645.
Also square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is Chebyshev polynomial of the first kind T_{2*k}(x), evaluated at x=n. - Seiichi Manyama, Dec 30 2018

Examples

			Row 2 gives {( (2+sqrt(3))^(2*n) + (2-sqrt(3))^(2*n) )/2}.
Square array begins:
     | 0    1       2          3             4
-----+---------------------------------------------
   1 | 1,   1,      1,         1,            1, ...
   2 | 1,   7,     97,      1351,        18817, ...
   3 | 1,  17,    577,     19601,       665857, ...
   4 | 1,  31,   1921,    119071,      7380481, ...
   5 | 1,  49,   4801,    470449,     46099201, ...
   6 | 1,  71,  10081,   1431431,    203253121, ...
   7 | 1,  97,  18817,   3650401,    708158977, ...
   8 | 1, 127,  32257,   8193151,   2081028097, ...
   9 | 1, 161,  51841,  16692641,   5374978561, ...
  10 | 1, 199,  79201,  31521799,  12545596801, ...
  11 | 1, 241, 116161,  55989361,  26986755841, ...
  12 | 1, 287, 164737,  94558751,  54276558337, ...
  13 | 1, 337, 227137, 153090001, 103182433537, ...
  14 | 1, 391, 305761, 239104711, 186979578241, ...
  15 | 1, 449, 403201, 362074049, 325142092801, ...
  ...
		

Crossrefs

Row 2 is A011943, row 3 is A056771, row 8 is A175633, (row 2)*2 is A067902, (row 9)*2 is A089775.
(column 1)*2 is A060626.
Cf. A188645 (f(x, y) as above with y=1).
Diagonals give A173129, A322899.

Programs

  • Mathematica
    max = 9; y = -1; t = Table[k = ((x^2 + y)^(1/2) + x)^2; ((k^n) + (k^(-n)))/2 // FullSimplify, {n, 0, max - 1}, {x, 1, max}]; Table[ t[[n - k + 1, k]], {n, 1, max}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jul 17 2013 *)

Formula

A(n,k) = (A188646(n,k-1) + A188646(n,k))/2.
A(n,k) = Sum_{j=0..k} binomial(2*k,2*j)*(n^2-1)^(k-j)*n^(2*j). - Seiichi Manyama, Jan 01 2019

Extensions

Edited by Seiichi Manyama, Dec 30 2018
More terms from Seiichi Manyama, Jan 01 2019

A173131 a(n) = (Cosh[(2n-1)ArcSinh[n]])^2.

Original entry on oeis.org

1, 2, 1445, 19740250, 1361599599377, 298514762397852026, 160545187370375075046277, 179656719395983409634002348450, 373368546362937441101158606899394625
Offset: 0

Views

Author

Artur Jasinski, Feb 10 2010

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Round[Cosh[(2 n - 1) ArcSinh[n]]^2], {n, 0, 10}] (* Artur Jasinski *)

Formula

a(n) ~ 2^(4*n-4) * n^(4*n-2). - Vaclav Kotesovec, Apr 05 2016

A173148 a(n) = cos(2*n*arccos(sqrt(n))).

Original entry on oeis.org

1, 1, 17, 485, 18817, 930249, 55989361, 3974443213, 325142092801, 30122754096401, 3117419602578001, 356452534779818421, 44627167107085622401, 6071840759403431812825, 892064955046043465408177, 140751338790698080509966749, 23737154316161495960243527681
Offset: 0

Views

Author

Artur Jasinski, Feb 11 2010

Keywords

Comments

The Chebyshev polynomial T_n is defined by cos(nx) = T_n(cos(x)). So T_2n(cos(x)) = cos(2nx) = cos^2(nx) - 1 = (T_n(x))^2 - 1 consists of only even powers of x. As a result, a(n) = T_2n(sqrt(n)) is an integer. - Michael B. Porter, Jan 01 2019

Crossrefs

Programs

  • GAP
    a:=List([0..20],n->Sum([0..n],k->Binomial(2*n,2*k)*(n-1)^(n-k)*n^k));; Print(a); # Muniru A Asiru, Jan 03 2019
    
  • Magma
    [&+[Binomial(2*n,2*k)*(n-1)^(n-k)*n^k: k in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Jan 03 2019
  • Mathematica
    Table[Round[Cos[2 n ArcCos[Sqrt[n]]]], {n, 0, 30}] (* Artur Jasinski, Feb 11 2010 *)
  • PARI
    {a(n) = sum(k=0, n, binomial(2*n, 2*k)*(n-1)^(n-k)*n^k)} \\ Seiichi Manyama, Dec 27 2018
    
  • PARI
    {a(n) = round(cosh(2*n*acosh(sqrt(n))))} \\ Seiichi Manyama, Dec 27 2018
    
  • PARI
    {a(n) = polchebyshev(n, 1, 2*n-1)} \\ Seiichi Manyama, Dec 29 2018
    

Formula

a(n) ~ exp(-1/2) * 2^(2*n-1) * n^n. - Vaclav Kotesovec, Apr 05 2016
a(n) = Sum_{k=0..n} binomial(2*n,2*k)*(n-1)^(n-k)*n^k. - Seiichi Manyama, Dec 27 2018
a(n) = cosh(2*n*arccosh(sqrt(n))). - Seiichi Manyama, Dec 27 2018
a(n) = T_{2*n}(sqrt(n)) = T_{n}(2*n-1) where T_{n}(x) is a Chebyshev polynomial of the first kind. - Seiichi Manyama, Dec 29 2018
a(n) = A322790(n-1, n) for n > 0. - Seiichi Manyama, Dec 29 2018

Extensions

Minor edits by Vaclav Kotesovec, Apr 05 2016

A173133 a(n) = Sinh[(2n-1) ArcSinh[n]].

Original entry on oeis.org

0, 1, 38, 4443, 1166876, 546365045, 400680904674, 423859315570607, 611038907405197432, 1151555487914640463209, 2748476184146759127540190, 8102732939160371170806346243, 28915133156938367486730067779348
Offset: 0

Views

Author

Artur Jasinski, Feb 10 2010

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Round[Sinh[(2 n - 1) ArcSinh[n]]], {n, 0, 20}] (* Artur Jasinski *)
    Round[Table[1/2 (n - Sqrt[1 + n^2])^(2 n - 1) + 1/2 (n + Sqrt[1 + n^2])^(2 n - 1), {n, 0, 10}]] (* Artur Jasinski, Feb 14 2010 *)

Formula

a(n) = 1/2 (n - sqrt(1 + n^2))^(2 n - 1) + 1/2 (n + sqrt(1 + n^2))^(2 n - 1). - Artur Jasinski, Feb 14 2010

Extensions

Minor edits by Vaclav Kotesovec, Apr 05 2016

A173134 a(n) = Sinh[(2n-1)ArcCosh[n]]^2.

Original entry on oeis.org

-1, 0, 675, 11309768, 878801253135, 208241673295152024, 118270071682117442287235, 137788343929239264227213170608, 295355309179742652677310128859789375
Offset: 0

Views

Author

Artur Jasinski, Feb 10 2010

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Round[Sinh[(2 n - 1) ArcCosh[n]]^2], {n, 0, 20}]

Formula

a(n) ~ 2^(4*n-4) * n^(4*n-2). - Vaclav Kotesovec, Apr 05 2016

A349071 a(n) = T(n, 2*n), where T(n, x) is the Chebyshev polynomial of the first kind.

Original entry on oeis.org

1, 2, 31, 846, 32257, 1580050, 94558751, 6686381534, 545471324161, 50428155189474, 5210183616019999, 594949288292777902, 74404881332329766401, 10114032809617941274226, 1484781814660796486716447, 234114571438498509048719550, 39459584112457284328544403457
Offset: 0

Views

Author

Vaclav Kotesovec, Nov 07 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[ChebyshevT[n, 2*n], {n, 0, 20}]
  • PARI
    a(n) = polchebyshev(n, 1, 2*n); \\ Michel Marcus, Nov 07 2021
    
  • Python
    from sympy import chebyshevt
    def A349071(n): return chebyshevt(n,n<<1) # Chai Wah Wu, Nov 08 2023

Formula

a(n) = cosh(n*arccosh(2*n)).
a(n) = ((2*n + sqrt(4*n^2-1))^n + (2*n - sqrt(4*n^2-1))^n)/2.
a(n) ~ 2^(2*n-1) * n^n.

A349073 a(n) = U(2*n, n), where U(n, x) is the Chebyshev polynomial of the second kind.

Original entry on oeis.org

1, 3, 209, 40391, 15003009, 9127651499, 8254109243953, 10393834843080975, 17391182043967249409, 37326390852372133364819, 99976027392046047055178001, 326887883645157139828711692503, 1281398359905415379814555044995201, 5932135472283024519893762690145006075
Offset: 0

Views

Author

Vaclav Kotesovec, Nov 07 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[ChebyshevU[2*n, n], {n, 0, 15}]
  • PARI
    a(n) = polchebyshev(2*n, 2, n); \\ Michel Marcus, Nov 07 2021
    
  • Python
    from sympy import chebyshevu
    def A349073(n): return chebyshevu(n<<1,n) # Chai Wah Wu, Nov 08 2023

Formula

For n>1, a(n) = ((n + sqrt(n^2-1))^(2*n+1) - (n - sqrt(n^2-1))^(2*n+1)) / (2*sqrt(n^2-1)).
a(n) ~ 2^(2*n) * n^(2*n).

A173170 a(n) = sin^2((2n-1)*arcsin(sqrt n)) = 1 - sin^2( (2n-1)*arccos(sqrt n)).

Original entry on oeis.org

0, 1, 50, 23763, 25421764, 48225038405, 142786923879606, 608447515452613207, 3527836867501829594888, 26710782540478226038759689, 255922222218837615280903143610, 3026917140685147530327256796600411
Offset: 0

Views

Author

Artur Jasinski, Feb 11 2010

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Round[Sin[(2 n - 1) ArcSin[Sqrt[n]]]^2], {n, 0, 20}] (* Artur Jasinski, Feb 11 2010 *)

Formula

a(n) ~ exp(-1) * 2^(4*n-4) * n^(2*n-1). - Vaclav Kotesovec, Apr 05 2016

Extensions

Minor edits by Vaclav Kotesovec, Apr 05 2016
Showing 1-10 of 15 results. Next