[seqfan] Re: Counting simple graphs with node degree >=2

Max Alekseyev maxale at gmail.com
Wed Sep 16 17:53:47 CEST 2015

Noticing that  A261919 is the first difference of  A004110, I've extended
the former to 26 terms.

On Wed, Sep 16, 2015 at 9:34 AM, Richard J. Mathar <mathar at mpia-hd.mpg.de>

> See http://list.seqfan.eu/pipermail/seqfan/2015-September/015292.html:
> Prompted by Neil, Brendan McKay has come to the same conclusion
> (priv. commun.) and contributed another variant in A261919 which allows
> graphs
> to have more than one component (to be disconnected).
> The first difference between A261919 and A004108 is at a(6), because on 6
> nodes
> we may have two disconnected triangles which individually fulfill the
> requirements.
> Richard Mathar
> _______________________________________________
> Seqfan Mailing list - http://list.seqfan.eu/

More information about the SeqFan mailing list