Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132464
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132464 Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(6,n). +0
2
0, 0, 0, 0, 0, 1, 48, 735, 6272, 37044, 169344, 640332, 2090880, 6073353, 16032016, 39078039, 89037312, 191456720, 391523328, 766192176, 1442244096, 2622518073, 4623197040, 7925786407, 13248326784, 21641442900, 34616067200, 54311107500, 83710972800 (list; graph; listen)
OFFSET

1,7

CROSSREFS

See A132458 for further information.

Adjacent sequences: A132461 A132462 A132463 this_sequence A132465 A132466 A132467

Sequence in context: A136038 A138411 A102279 this_sequence A105948 A014401 A014703

KEYWORD

nonn

AUTHOR

Ottavio D'Antona (dantona(AT)dico.unimi.it), Oct 31 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research