Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126962
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126962 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(1,n). +0
2
1, 1, -2, -12, 24, 420, -720, -30240, 40320, 3764880, -3628800, -728481600, 479001600, 203545742400, -87178291200, -77806624896000, 20922789888000, 39045031657632000, -6402373705728000, -24904933604014464000, 2432902008176640000, 19678195269815322240000, -1124000727777607680000 (list; graph; listen)
OFFSET

0,3

REFERENCES

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

CROSSREFS

A column of A105937.

Sequence in context: A121119 A052565 A141900 this_sequence A002207 A091137 A092825

Adjacent sequences: A126959 A126960 A126961 this_sequence A126963 A126964 A126965

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