login
A182294
Number of connected labeled graphs with n nodes and n+9 edges.
2
0, 0, 0, 0, 0, 1, 20349, 21426300, 8956859646, 2352103292070, 470090359867986, 79002015147719136, 11836068369346126698, 1640443794179544776604, 215598057543037336382670, 27336005392867324870778880, 3385297472808136707459580488, 413211903044379104303226531072
OFFSET
1,7
LINKS
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.
MAPLE
N:=20: [seq(coeff(op(i, [seq(coeff(taylor(log(add(x^i*(1+y)^(binomial(i, 2))/i!, i=0..N)), x=0, N+1), x, i)*i!, i=1..N)]), y, i-1+10), i=1..N)];
CROSSREFS
A diagonal of A343088.
Cf. A057500.
Sequence in context: A343243 A156408 A045815 * A103912 A256104 A269279
KEYWORD
nonn
AUTHOR
Michael Burkhart, Apr 23 2012
EXTENSIONS
Offset corrected and terms a(16) and beyond from Andrew Howroyd, Apr 16 2021
STATUS
approved