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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126934 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(0,2n). 1
1, -2, 36, -1800, 176400, -28576800, 6915585600, -2337467932800, 1051860569760000, -607975409321280000, 438958245529964160000, -387161172557428389120000, 409616520565759235688960000, -512020650707199044611200000000, 746526108731096207043129600000000, -1255656914885703820246543987200000000 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

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

FORMULA

a(n) = A001147(n) * A001813(n). - N. J. A. Sloane (njas(AT)research.att.com), Mar 21 2007

CROSSREFS

See A105937 for the full array. See also A127080.

Sequence in context: A174580 A088026 A174881 * A178949 A200571 A203021

Adjacent sequences:  A126931 A126932 A126933 * A126935 A126936 A126937

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 17 13:28 EST 2012. Contains 206031 sequences.