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.

A182294 Number of connected labeled graphs with n nodes and n+9 edges.

This page as a plain text file.
%I A182294 #26 Jun 22 2025 13:43:28
%S A182294 0,0,0,0,0,1,20349,21426300,8956859646,2352103292070,470090359867986,
%T A182294 79002015147719136,11836068369346126698,1640443794179544776604,
%U A182294 215598057543037336382670,27336005392867324870778880,3385297472808136707459580488,413211903044379104303226531072
%N A182294 Number of connected labeled graphs with n nodes and n+9 edges.
%H A182294 Andrew Howroyd, <a href="/A182294/b182294.txt">Table of n, a(n) for n = 1..100</a>
%H A182294 Steven R. Finch, <a href="https://arxiv.org/abs/2408.12440">An exceptional convolutional recurrence</a>, arXiv:2408.12440 [math.CO], 22 Aug 2024.
%H A182294 S. Janson, D. E. Knuth, T. Ɓuczak and B. Pittel, <a href="http://dx.doi.org/10.1002/rsa.3240040303">The Birth of the Giant Component</a>, Random Structures and Algorithms Vol. 4 (1993), 233-358.
%p A182294 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)];
%Y A182294 A diagonal of A343088.
%Y A182294 Cf. A057500.
%K A182294 nonn
%O A182294 1,7
%A A182294 _Michael Burkhart_, Apr 23 2012
%E A182294 Offset corrected and terms a(16) and beyond from _Andrew Howroyd_, Apr 16 2021