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.

A213432 a(n) = 2^(n-3)*binomial(n,4).

Original entry on oeis.org

0, 0, 0, 0, 2, 20, 120, 560, 2240, 8064, 26880, 84480, 253440, 732160, 2050048, 5591040, 14909440, 38993920, 100270080, 254017536, 635043840, 1568931840, 3835166720, 9285140480, 22284337152, 53057945600, 125409689600, 294440140800, 687026995200, 1593902628864, 3678236835840, 8446321623040, 19305877995520, 43937515438080, 99591701659648
Offset: 0

Views

Author

N. J. A. Sloane, Jun 11 2012

Keywords

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

Programs

  • Mathematica
    A213432[n_] := 2^(n-3)*Binomial[n, 4]; Array[A213432, 35, 0] (* or *)
    LinearRecurrence[{10, -40, 80, -80, 32}, {0, 0, 0, 0, 2}, 35] (* Paolo Xausa, Feb 22 2024 *)

Formula

G.f.: -2*x^4 / (2*x-1)^5. - Colin Barker, Jul 22 2013
a(n) = 2*A003472(n). - R. J. Mathar, Jun 18 2014