login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127137 Define an array by Q(m, 0) = 1, Q(m, 1) = 1; Q(m, 2k) = (m - 2k + 1)*Q(m+1, 2k-1) - (2k-1)*Q(m+2, k-2), m*Q(m, 2k+1) = (m - 2k)*Q(m+1, 2k) - 2k(m+1)*Q(m+2, 2k-1). Sequence gives Q(0,n). 7
1, 1, -2, -5, 12, 43, -120, -531, 1680, 8601, -30240, -172965, 665280, 4161555, -17297280, -116658675, 518918400, 3735104625, -17643225600, -134498225925, 670442572800, 5380583766075, -28158588057600, -236759435017875, 1295295050649600, 11364769115001225, -64764752532480000 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

REFERENCES

V. van der Noort and N. J. A. Sloane, Paper in preparation, 2007.

FORMULA

See A127080 for e.g.f.

CROSSREFS

A001813 interleaved with A090470.

See A127080 for the array Q. A column of A127080.

Sequence in context: A005664 A009739 A062272 * A172239 A183758 A071787

Adjacent sequences:  A127134 A127135 A127136 * A127138 A127139 A127140

KEYWORD

sign

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Mar 24 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 09:00 EST 2012. Contains 205904 sequences.