login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007111 Number of unlabeled graphs with n nodes and degree >= 3.
(Formerly M3060)
3
0, 0, 0, 0, 1, 3, 19, 150, 2590, 84245, 5203135, 577076735, 113373008891, 39618075369549, 24916469695937480, 28563628406766988588, 60366734880395211775791, 237406976195471782149927759, 1750330442243458287054664072364 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

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

CROSSREFS

Euler transform of A007112.

Sequence in context: A354319 A324226 A007112 * A346385 A113013 A307489

Adjacent sequences: A007108 A007109 A007110 * A007112 A007113 A007114

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 12:40 EST 2022. Contains 358468 sequences. (Running on oeis4.)