Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127070 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(4,n). +0
2
1, 4, 10, -24, -420, -960, 22680, 201600, -1496880, -36288000, 64864800, 7823692800, 25297272000, -2092278988800, -18988521552000, 690452066304000, 11457025515936000, -277436193914880000, -7430805000755136000, 133809610449715200000, 5500591866494524800000, -76432049488877322240000 (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: A080628 A001868 A038783 this_sequence A107961 A051864 A111153

Adjacent sequences: A127067 A127068 A127069 this_sequence A127071 A127072 A127073

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