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.

A370772 Triangle read by rows: T(n,k) is the number of k-trees with n unlabeled nodes rooted at a hedron.

Original entry on oeis.org

0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 3, 1, 1, 0, 1, 6, 3, 1, 1, 0, 1, 16, 10, 3, 1, 1, 0, 1, 37, 39, 10, 3, 1, 1, 0, 1, 96, 164, 48, 10, 3, 1, 1, 0, 1, 239, 746, 253, 48, 10, 3, 1, 1, 0, 1, 622, 3474, 1584, 273, 48, 10, 3, 1, 1, 0, 1, 1607, 16658, 10500, 1913, 273, 48, 10, 3, 1, 1, 0
Offset: 0

Views

Author

Andrew Howroyd, Mar 01 2024

Keywords

Comments

A hedron is a (k+1)-clique.

Examples

			Triangle begins:
  0;
  1,   0;
  1,   1,    0;
  1,   1,    1,    0;
  1,   3,    1,    1,   0;
  1,   6,    3,    1,   1,  0;
  1,  16,   10,    3,   1,  1,  0;
  1,  37,   39,   10,   3,  1,  1, 0;
  1,  96,  164,   48,  10,  3,  1, 1, 0;
  1, 239,  746,  253,  48, 10,  3, 1, 1, 0;
  1, 622, 3474, 1584, 273, 48, 10, 3, 1, 1, 0;
  ...
		

Crossrefs

Columns k=1..2 are A027852, A063688(n-2).
Cf. A370770 (unrooted), A370771, A370773.