A008327 Triangle read by rows: T(n,k) is the number of simple regular bipartite graphs with 2n nodes and degree k, (0 <= k <= n).
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 6, 4, 1, 1, 1, 1, 4, 14, 14, 4, 1, 1, 1, 1, 7, 41, 130, 41, 7, 1, 1, 1, 1, 8, 157, 1981, 1981, 157, 8, 1, 1, 1, 1, 12, 725, 62616, 304496, 62616, 725, 12, 1, 1, 1, 1, 14, 4196, 2806508, 78322916
Offset: 0
Examples
Triangle begins: 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 6, 4, 1, 1; 1, 1, 4, 14, 14, 4, 1, 1; 1, 1, 7, 41, 130, 41, 7, 1, 1; 1, 1, 8, 157, 1981, 1981, 157, 8, 1, 1; ...
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..189
- B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.
Crossrefs
Formula
Column k is the Euler transform of column k of A008326. - Andrew Howroyd, Apr 03 2020
Extensions
More terms from Eric Rogoyski, May 15 1997
Name clarified by Andrew Howroyd, Sep 05 2018
Comments