Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
1, 3, 4, -30, -216, 420, 14400, 22680, -1411200, -8482320, 195955200, 2399997600, -36883123200, -788107320000, 9066542284800, 318173519664000, -2824576634880000, -159078423407904000, 1088403529973760000, 97970873094110016000, -508476519708917760000, -73631427647097640320000 (list; graph; listen)
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 this_sequence A058603 A042653 A042431

Adjacent sequences: A127065 A127066 A127067 this_sequence A127069 A127070 A127071

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 December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research