login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213432 a(n) = 2^(n-3)*binomial(n,4).
(Formerly N0837)
1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
LINKS
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
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 *)
CROSSREFS
Sequence in context: A203238 A061004 A278772 * A219837 A219759 A196797
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 11 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)