login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005636 Number of n-node connected graphs without points of degree 2.
(Formerly M1548)
3
1, 1, 0, 2, 5, 32, 234, 3638, 106147, 6039504, 633754161, 120131932774, 41036773627286, 25445404202438466, 28918219616495404542, 60799423389360189091576, 238378454962362129667078385 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

R. W. Robinson, personal communication.

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

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 = 1..28

R. W. Robinson, Cubic graphs (notes)

CROSSREFS

Sequence in context: A221680 A009274 A019036 * A067299 A203227 A207135

Adjacent sequences:  A005633 A005634 A005635 * A005637 A005638 A005639

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 15 07:25 EST 2018. Contains 317225 sequences. (Running on oeis4.)