Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134094
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134094 Row sums of triangle A134090. +0
5
1, 2, 6, 26, 140, 887, 6405, 51564, 455712, 4370567, 45081476, 496556194, 5806502663, 71734434956, 932447207866, 12707973761320, 181033752071568, 2688530124711819, 41525910256013832, 665674913113633582 (list; graph; listen)
OFFSET

0,2

COMMENT

Row n of triangle T=A134090 = row n of (I + D*C)^n for n>=0 where C denotes Pascal's triangle, I the identity matrix and D a matrix where D(n+1,n)=1 and zeros elsewhere.

FORMULA

a(n) = [x^n] Sum_{k=0..n} C(n,k)*x^k*(1-k*x) / [Product_{i=0..k+1}(1-i*x)], equivalently, a(n) = Sum_{k=0..n} C(n,k)*[S2(n,k) - k*S2(n-1,k)], where S2(n,k) = A048993(n,k) are Stirling numbers of the 2nd kind.

PROGRAM

(PARI) {a(n)=sum(k=0, n, binomial(n, k)*polcoeff((1-k*x)/prod(i=0, k+1, 1-i*x+x*O(x^(n))), n-k))}

CROSSREFS

Cf. A134090; columns: A122455, A134091, A134092, A134093; A048993 (S2).

Sequence in context: A030957 A030898 A002788 this_sequence A009575 A127116 A107404

Adjacent sequences: A134091 A134092 A134093 this_sequence A134095 A134096 A134097

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 08 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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research