Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062193
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062193 Fourth (unsigned) column sequence of triangle A062139 (generalized a=2 Laguerre). +0
4
1, 24, 420, 6720, 105840, 1693440, 27941760, 479001600, 8562153600, 159826867200, 3116623910400, 63465795993600, 1348648164864000, 29877743960064000, 689322235650048000, 16543733655601152000 (list; graph; listen)
OFFSET

0,2

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

Index entries for sequences related to Laguerre polynomials

FORMULA

E.g.f.: (1+15*x+30*x^2+10*x^3)/(1-x)^9.

a(n)=A062139(n+3, 3) = (n+3)!*binomial(n+5, 5)/3!.

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-3)=(-1)^(n-1)*f(n,3,-6), (n>=3). [From Milan R. Janjic (agnus(AT)blic.net), Mar 01 2009]

PROGRAM

(Other) sage: [binomial(n, 5)*factorial (n-2)/6 for n in xrange(5, 21)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 07 2009]

(PARI) { f=2; for (n=0, 100, f*=n + 3; write("b062193.txt", n, " ", f*binomial(n + 5, 5)/6) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 02 2009]

CROSSREFS

A001710, A005990, A005461.

Sequence in context: A018092 A016326 A072975 this_sequence A016268 A051546 A081128

Adjacent sequences: A062190 A062191 A062192 this_sequence A062194 A062195 A062196

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Jun 19 2001

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research