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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126935 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(n,3). 1
0, -12, -24, -30, -24, 0, 48, 126, 240, 396, 600, 858, 1176, 1560, 2016, 2550, 3168, 3876, 4680, 5586, 6600, 7728, 8976, 10350, 11856, 13500, 15288, 17226, 19320, 21576, 24000, 26598, 29376, 32340, 35496, 38850, 42408, 46176, 50160, 54366, 58800, 63468, 68376, 73530 (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) = n(n+2)(n-5).

CROSSREFS

A row of A105937.

Sequence in context: A167994 A065303 A108902 * A074697 A027854 A009096

Adjacent sequences:  A126932 A126933 A126934 * A126936 A126937 A126938

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 07:39 EST 2012. Contains 205881 sequences.