Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127067 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(2,n). +0
2
1, 2, 0, -24, -60, 720, 5040, -40320, -589680, 3628800, 99792000, -479001600, -23740516800, 87178291200, 7682586912000, -20922789888000, -3281772285792000, 6402373705728000, 1801868049805824000, -2432902008176640000, -1241948957556827520000, 1124000727777607680000 (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: A005359 A008842 A130915 this_sequence A052607 A052602 A012588

Adjacent sequences: A127064 A127065 A127066 this_sequence A127068 A127069 A127070

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research