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!)
A007124 Number of strength 1 Eulerian graphs with n nodes, 2 of odd degree.
(Formerly M1494)
1

%I M1494 #9 Mar 30 2012 16:45:08

%S 0,1,2,5,16,62,344,2888,42160,1130244,57349936,5479605296,

%T 979383162528,326346868386848,202753892253143616,

%U 235314078797344415360,511563560865769179773568,2089489084248273187063929888

%N Number of strength 1 Eulerian graphs with n nodes, 2 of odd degree.

%D R. W. Robinson, personal communication.

%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.

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

%H R. W. Robinson, <a href="/A007124/b007124.txt">Table of n, a(n) for n = 1..26</a>

%K nonn

%O 1,3

%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 March 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)