A177067 - OEIS

%I #17 Jul 28 2019 16:30:18

%S 2,5,4,2,0,0,3,8,9,2,7,1,0,3,5,3,2,1,4,3,7,2,0,3,8,9,4,2,1,4,4,6,4,7,

%T 1,6,3,4,6,8,0,3,5,1,3,2,4,9,9,3,1,8,6,3,1,1,4,5,3,3,5,8,0,4,3,3,9,4,

%U 4,5,9,5,1

%N Decimal expansion of sqrt(3/(2 Pi))/e.

%C This is the leading constant in the asymptotic formula for the number of labeled 2-connected (simple) graphs.

%H Graeme Kemkes, Cristiane M. Sato, and Nicholas Wormald, <a href="https://arxiv.org/abs/1010.2516">Asymptotic enumeration of sparse 2-connected graphs</a>, arXiv:1010.2516 [math.CO], 2010-2011. See Section 2, especially Corollary 3.

%H E. M. Wright, <a href="https://doi.org/10.1002/jgt.3190070211">The number of connected sparsely edged graphs. IV. Large nonseparable graphs</a>, J. Graph Theory 7 (1983), 219-229. See Theorem 4.

%e 0.2542003...

%p evalf(sqrt(3/2/Pi)/exp(1))

%t RealDigits[Sqrt[3/(2Pi)]/E,10,120][[1]] (* _Harvey P. Dale_, Jul 28 2019 *)

%K nonn,cons

%O 0,1

%A _Graeme Kemkes_, Dec 09 2010