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!)
A005637 Number of n-node graphs without nodes of degree 2.
(Formerly M0352)
3

%I M0352 #17 Jan 10 2018 16:10:35

%S 1,1,2,2,5,10,45,284,3960,110356,6153615,640014800,120777999811,

%T 41158185726269,25486682538903526,28943747337743989421,

%U 60828392582465943631269,238439312273287947102629832

%N Number of n-node graphs without nodes of degree 2.

%D R. W. Robinson, personal communication.

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

%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="/A005637/b005637.txt">Table of n, a(n) for n = 0..28</a>

%H R. W. Robinson, <a href="/A005636/a005636.pdf">Cubic graphs (notes)</a>

%K nonn

%O 0,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 April 24 07:35 EDT 2024. Contains 371922 sequences. (Running on oeis4.)