login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324670 Number of simple graphs on n unlabeled nodes with minimum degree exactly 2. 2
0, 0, 1, 2, 8, 43, 360, 4869, 113622, 4605833, 325817259, 40350371693, 8825083057727, 3447229161054412, 2432897732375453872, 3135299553791882831175, 7445569254636418368355175, 32831169277561326131677454356, 270499962116368309216399255404116 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..19.

Eric Weisstein's World of Mathematics, Minimum Vertex Degree

FORMULA

a(n) = A261919(n) - A007111(n).

CROSSREFS

Column k=2 of A294217.

A diagonal of A263293.

Cf. A005637, A007111, A261919.

Sequence in context: A106327 A009309 A276497 * A334335 A283416 A075817

Adjacent sequences:  A324667 A324668 A324669 * A324671 A324672 A324673

KEYWORD

nonn

AUTHOR

Andrew Howroyd, Sep 03 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 31 06:57 EDT 2021. Contains 346369 sequences. (Running on oeis4.)