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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127068 Define an array by d(m, 0) = 1, d(m, 1) = m; d(m, k) = (m - k + 1) d(m+1, k-1) - (k-1) (m+1) d(m+2, k-2). Sequence gives d(3,n). 1
1, 3, 4, -30, -216, 420, 14400, 22680, -1411200, -8482320, 195955200, 2399997600, -36883123200, -788107320000, 9066542284800, 318173519664000, -2824576634880000, -159078423407904000, 1088403529973760000, 97970873094110016000, -508476519708917760000, -73631427647097640320000 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

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

CROSSREFS

A column of A105937.

Sequence in context: A076001 A032833 A151466 * A058603 A042653 A042431

Adjacent sequences:  A127065 A127066 A127067 * A127069 A127070 A127071

KEYWORD

sign

AUTHOR

Vincent v.d. Noort, Mar 21 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 17:48 EST 2012. Contains 205939 sequences.