A182295 Number of connected labeled graphs with n nodes and n+10 edges.

0, 0, 0, 0, 0, 0, 5985, 13112470, 8535294180, 3096620034795, 800118566011380, 166591475854153740, 30012638793107746776, 4892304538906805158775, 743352352817243899253160, 107478174967432322995403280, 15008321493306766503800761840, 2046331888629918743459557040544

Offset: 1

Author

Michael Burkhart, Apr 23 2012

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 1..100
• Steven R. Finch, An exceptional convolutional recurrence, arXiv:2408.12440 [math.CO], 22 Aug 2024.
• S. Janson, D. E. Knuth, T. Łuczak 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.

Programs

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+11),i=1..N)];

Extensions

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