A054957 - OEIS

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

A054957

Number of labeled connected Eulerian digraphs with n nodes.

3

1, 1, 6, 118, 7000, 1329496, 868255024, 2039295163312, 17639804273910144, 569596637165777524096, 69273803156588266525129984, 31940576331984155835757999795456, 56121305700570450429977355284230355968, 377361653292638108206937443603065676106341376

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..16

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

FORMULA

a(n) = A054958(n) + A054959(n). - R. J. Mathar, Apr 13 2017

CROSSREFS

Cf. A058338, A054955, A007080 (EXP-transform), A054959, A054956, A058337, A054958.

Sequence in context: A135869 A218713 A360426 * A373239 A271648 A353691

Adjacent sequences: A054954 A054955 A054956 * A054958 A054959 A054960

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic, Mar 06 2001

More terms from Alois P. Heinz, Apr 14 2017

STATUS

approved