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
1, 1, 2, 2, 5, 10, 45, 284, 3960, 110356, 6153615, 640014800, 120777999811, 41158185726269, 25486682538903526, 28943747337743989421, 60828392582465943631269, 238439312273287947102629832 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
REFERENCES
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
R. W. Robinson, Cubic graphs (notes)
CROSSREFS
Sequence in context: A245306 A296530 A117400 * A233018 A209100 A208864
KEYWORD
nonn
AUTHOR
STATUS
approved

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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)