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.

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).

Original entry on oeis.org

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

Views

Author

Keywords

Comments

This sequence can be derived from A008326 by Euler transform. - Andrew Howroyd, Apr 03 2020

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;
  ...
		

Crossrefs

Column k=0..5 are A000012, A000012, A002865, A008325, A333730, A333731.
Row sums are A008324.

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