A352067 Triangle read by rows: T(n,k) is the number of connected graphs with n nodes and degeneracy k, 0 <= k < n.

1, 0, 1, 0, 1, 1, 0, 2, 3, 1, 0, 3, 13, 4, 1, 0, 6, 62, 37, 6, 1, 0, 11, 364, 393, 77, 7, 1, 0, 23, 2799, 6485, 1665, 135, 9, 1, 0, 47, 27811, 158766, 68957, 5268, 220, 10, 1, 0, 106, 349306, 5718805, 5091421, 541593, 14997, 330, 12, 1

Offset: 1

Author

Pontus von Brömssen, Mar 05 2022

Keywords

• nonn
• tabl

Examples

			Triangle begins:
  n\k| 0   1      2       3       4      5     6   7  8  9
  ---+----------------------------------------------------
   1 | 1
   2 | 0   1
   3 | 0   1      1
   4 | 0   2      3       1
   5 | 0   3     13       4       1
   6 | 0   6     62      37       6      1
   7 | 0  11    364     393      77      7     1
   8 | 0  23   2799    6485    1665    135     9   1
   9 | 0  47  27811  158766   68957   5268   220  10  1
  10 | 0 106 349306 5718805 5091421 541593 14997 330 12  1
		

Links

• Pontus von Brömssen, Rows n = 1..11, flattened
• Wikipedia, Degeneracy

Crossrefs

Row sums: A001349, column k=1: A000055.