login
This site is supported by donations 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)
1
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, Table of n, a(n) for n = 0..28

R. W. Robinson, Cubic graphs (notes)

CROSSREFS

Sequence in context: A245306 A296530 A117400 * A233018 A209100 A208864

Adjacent sequences:  A005634 A005635 A005636 * A005638 A005639 A005640

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 11:09 EST 2018. Contains 317133 sequences. (Running on oeis4.)