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!)
A005641 Number of 2-diregular digraphs with n nodes.
(Formerly M2757)
3

%I M2757 #26 May 12 2019 18:22:08

%S 1,3,8,27,131,711,5055,41607,389759,4065605,46612528,581713045,

%T 7846380548,113718755478,1762208816647,29073392136390,508777045979418

%N Number of 2-diregular digraphs with n nodes.

%C These graphs may have loops, whereas A219889 does not admit them. Both sequences do not admit multiedges. - _R. J. Mathar_, Mar 27 2019

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Richard J. Mathar, <a href="https://arxiv.org/abs/1903.12477">2-regular Digraphs of the Lovelock Lagrangian</a>, arXiv:1903.12477 [math.GM], 2019.

%H M. V. S. Ramanath and T. R. Walsh, <a href="/A005641/a005641.pdf">Enumeration and generation of a class of regular digraphs</a>, J. Graph Theory 11 (1987), no. 4, 471-479. (Annotated scanned copy)

%Y Cf. A005642 (inverse Euler transform, connected graphs).

%K nonn

%O 2,2

%A _N. J. A. Sloane_

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 April 25 11:03 EDT 2024. Contains 371967 sequences. (Running on oeis4.)