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.

A173174 a(n) = cosh(2*n*arcsinh(sqrt(n))).

Original entry on oeis.org

1, 3, 49, 1351, 51841, 2550251, 153090001, 10850138895, 886731088897, 82094249361619, 8491781781142001, 970614726270742103, 121485428812828080001, 16525390478051500325307, 2427469037137019032095121, 382956978214541873571486751, 64576903826545426454350012417, 11591229031806966336496244914595
Offset: 0

Views

Author

Artur Jasinski, Feb 11 2010

Keywords

Crossrefs

Programs

  • Magma
    [&+[Binomial(2*n, 2*k)*(n+1)^(n-k)*n^k: k in [0..n]]: n in [0..20]]; // Vincenzo Librandi, Dec 29 2018
  • Maple
    A173174 := proc(n) cosh(2*n*arcsinh(sqrt(n))) ; expand(%) ; simplify(%) ; end proc: # R. J. Mathar, Feb 26 2011
  • Mathematica
    Table[Round[N[Cosh[(2 n) ArcSinh[Sqrt[n]]], 100]], {n, 0, 30}] (* Artur Jasinski *)
    Join[{1}, a[n_]:=Sum[Binomial[2 n, 2 k] (n + 1)^(n - k) n^k, {k, 0, n}]; Array[a, 25]] (* Vincenzo Librandi, Dec 29 2018 *)
  • PARI
    {a(n) = sum(k=0, n, binomial(2*n, 2*k)*(n+1)^(n-k)*n^k)} \\ Seiichi Manyama, Dec 26 2018
    
  • PARI
    {a(n) = polchebyshev(n, 1, 2*n+1)} \\ Seiichi Manyama, Dec 29 2018
    

Formula

a(n) = Sum_{k=0..n} binomial(2*n,2*k)*(n+1)^(n-k)*n^k. - Seiichi Manyama, Dec 26 2018
a(n) = T_{n}(2*n+1) where T_{n}(x) is a Chebyshev polynomial of the first kind. - Seiichi Manyama, Dec 29 2018

Extensions

More terms from Seiichi Manyama, Dec 26 2018