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.

A000318 Generalized tangent numbers d(4,n).

Original entry on oeis.org

4, 128, 16384, 4456448, 2080374784, 1483911200768, 1501108249821184, 2044143848640217088, 3605459138582973251584, 7995891855149741436305408, 21776918737280678860353961984, 71454103701490016776039304265728, 278008871543597996197497752082448384
Offset: 1

Views

Author

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

  • Maple
    egf := sec(4*x)*sin(4*x): ser := series(egf, x, 26):
    seq((2*n-1)!*coeff(ser, x, 2*n-1), n = 1..12); # Peter Luschny, Nov 21 2021
  • Mathematica
    nn = 30; t = Rest@Union[Range[0, nn - 1]! CoefficientList[Series[Tan[x], {x, 0, nn}], x]]; t2 = t*2^Range[2, 2*nn, 4] (* T. D. Noe, Jun 19 2012 *)

Formula

a(n) = 2^(4n-2) * A000182(n).
The g.f. has the following continued fraction expansion: g.f. = [4, b(0), c(0), b(1), c(1), b(2), c(2), ...] where b(n) = (Sum_{k=0..n} 1/(2*k+1))^2 / (128*(n+1)*x), c(n) = -4/((2*n+3)*(Sum_{k=0..n} 1/(2*k+1))*(Sum_{k=0..n+1} 1/(2*k+1))) and each convergent of this continued fraction is a Padé approximant of the Maclaurin series Sum_{k>=1} a(n)*x^(n-1). - Thomas Baruchel, Oct 19 2005
a(n) = (2*n-1)!*[x^(2*n-1)](sec(4*x)*sin(4*x)). - Peter Luschny, Nov 21 2021

Extensions

More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Jun 03 2000