A096150 Number of connected labeled graphs with n nodes and n+7 edges.

0, 0, 0, 0, 0, 105, 116175, 37007656, 7032842901, 1016662746825, 125217059384890, 13979620699390500, 1468384747758433362, 148610523724144786304, 14725179052834536611325, 1444367897584925254381440, 141356080305700826710780155, 13881663444819892480039097856

Offset

1,6

Links

Andrew Howroyd, Table of n, a(n) for n = 1..100

S. R. Finch, An exceptional convolutional recurrence, arXiv:2408.12440 [math.CO], 22 Aug 2024.

S. Janson, D. E. Knuth, T. Luczak and B. Pittel, The Birth of the Giant Component, Random Structures and Algorithms Vol. 4 (1993), 233-358.

Crossrefs

A diagonal of A343088.

Cf. A057500.

Sequence in context: A171116 A199100 A225217 * A068256 A062031 A199522

Adjacent sequences: A096147 A096148 A096149 * A096151 A096152 A096153

Keyword

nonn

Author

Keith Briggs, Aug 09 2004

Extensions

Offset corrected and terms a(16) and beyond from Andrew Howroyd, Apr 16 2021

Status

approved