Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126935
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
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; listen)
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: A119588 A065303 A108902 this_sequence A074697 A027854 A009096

Adjacent sequences: A126932 A126933 A126934 this_sequence A126936 A126937 A126938

KEYWORD

sign

AUTHOR

Vincent v.d. Noort, Mar 21 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research