login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246823 Decimal expansion of the asymptotic cost of the minimum edge cover in a complete bipartite graph with independent exponentially distributed edge costs. 0

%I #10 Jan 17 2020 16:08:47

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

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

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

%N Decimal expansion of the asymptotic cost of the minimum edge cover in a complete bipartite graph with independent exponentially distributed edge costs.

%H Steven R. Finch, <a href="http://arxiv.org/abs/2001.00578">Errata and Addenda to Mathematical Constants</a>, p. 55.

%H Martin Hessler and Johan Wästlund, <a href="http://www.math.chalmers.se/~wastlund/HesslerWastlund.pdf">Edge cover and polymatroid flow problems</a>

%F W(1)^2 + 2W(1), where W is the Lambert W-function (also known as ProductLog).

%e 1.4559380926764041940121489409573249821802836023232...

%t RealDigits[ProductLog[1]^2 + 2*ProductLog[1], 10, 104] // First

%Y Cf. A030178.

%K nonn,cons,easy

%O 1,2

%A _Jean-François Alcover_, Sep 04 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)