cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A120945 Triangle T(n,k) of number of labeled directed multigraphs (with loops), without isolated vertices, with n arrows and k vertices (n = 1,2,.., k = 1..2*n).

Original entry on oeis.org

1, 2, 1, 8, 18, 12, 1, 18, 108, 272, 300, 120, 1, 33, 393, 2102, 5700, 8160, 5880, 1680, 1, 54, 1122, 10688, 53550, 153132, 258720, 255360, 136080, 30240, 1, 82, 2754, 42752, 351650, 1688892, 5025832, 9540272, 11566800, 8668800, 3659040, 665280
Offset: 1

Views

Author

Vladeta Jovovic, Aug 19 2006

Keywords

Examples

			[1,2], [1,8,18,12], [1,18,108,272,300,120], [1,33,393,2102,5700,8160,5880,1680], ....
		

Crossrefs

Row sums give A104209.

Formula

T(n,k) = Sum_{j=0..k} (-1)^(k-j)*binomial(k,j)*binomial(j^2+n-1,n). Row sums give A104209.
E.g.f.: exp(-x)*Sum((1-y)^(-n^2)*x^n/n!,n=0..infinity). - Vladeta Jovovic, Aug 24 2006