|
%I M3605 #26 Nov 07 2021 15:28:08
%S 1,0,1,4,24,193,2420,47912,1600524,93253226,9694177479,1822463625183,
%T 625829508087155,395785845695978077,464137111800208818956,
%U 1015091598240432264958267,4160447480034069826186309689,32088552194861245127627790541334
%N Number of rooted bridgeless graphs with n nodes.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Andrew Howroyd, <a href="/A007145/b007145.txt">Table of n, a(n) for n = 1..40</a> (terms 1..22 from R. J. Mathar, terms 21..22 corrected by Andrew Howroyd)
%H P. Hanlon and R. W. Robinson, <a href="http://dx.doi.org/10.1016/0095-8956(82)90048-X">Counting bridgeless graphs</a>, J. Combin. Theory, B 33 (1982), 276-305.
%o (PARI) \\ See A004115 for graphsSeries and A339645 for combinatorial species functions.
%o cycleIndexSeries(n)={my(g=graphsSeries(n), gcr=sPoint(g)/g); sSolve( gcr, x*sv(1)*sExp(gcr) )}
%o NumUnlabeledObjsSeq(cycleIndexSeries(15)) \\ _Andrew Howroyd_, Dec 27 2020
%Y Cf. A004115, A007146.
%K nonn,nice
%O 1,4
%A _N. J. A. Sloane_
%E Reference gives first 22 terms (terms a(21) and a(22) contain typos).
%E More terms from _R. J. Mathar_, Jun 06 2007
|
