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

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, 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, 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

Offset: 1

Author

Jean-François Alcover, Sep 04 2014

Keywords

• nonn
• cons
• easy

Examples

			1.4559380926764041940121489409573249821802836023232...
		

Links

• Steven R. Finch, Errata and Addenda to Mathematical Constants, p. 55.
• Martin Hessler and Johan Wästlund, Edge cover and polymatroid flow problems

Crossrefs

Cf. A030178.

Programs

Mathematica

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

Formula

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