Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111600 Lah numbers: n!*binomial(n-1,9)/10!. +0
2
1, 110, 7260, 377520, 17177160, 721440720, 28857628800, 1121325004800, 42890681433600, 1629845894476800, 61934143990118400, 2364758225077248000, 91043191665474048000, 3543681152517682176000, 139722285442125754368000 (list; graph; listen)
OFFSET

10,2

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 156.

J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 44.

FORMULA

E.g.f. ((x/(1-x))^10)/10!.

a(n)= (n!/10!)*binomial(n-1, 10-1).

If we define f(n,i,x)= sum(sum(binomial(k,j)*stirling1(n,k)*stirling2(j,i)*x^(k-j),j=i..k),k=i..n) then a(n)=(-1)^n*f(n,10,-10), (n>=10). [From Milan R. Janjic (agnus(AT)blic.net), Mar 01 2009]

CROSSREFS

Column 10 of unsigned A008297 and A111596. Column 9: A111599.

Sequence in context: A163729 A035836 A008395 this_sequence A111784 A146495 A063751

Adjacent sequences: A111597 A111598 A111599 this_sequence A111601 A111602 A111603

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Aug 23 2005

page 1

Search completed in 0.003 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 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research