[seqfan] Re: A graph counting problem
Andrew Weimholt
andrew.weimholt at gmail.com
Wed Dec 30 22:37:27 CET 2009
On Wed, Dec 30, 2009 at 7:20 AM, <franktaw at netscape.net> wrote:
>
> the number of connected graphs of this sort, starting at n = 1,
>
> 1,1,2,3,6,12,28,65.
>
[...]
> matches
> <http://www.research.att.com/~njas/sequences/A073431>; a sequence
> concerning gatomorphisms.
>
> So, are these numbers correct? Can someone compute more, and verify or
> refute the match to A073431? If it does match, what does it mean?
computing by hand I get
1,1,2,3,6,12,28,65,172, which differs from A073431
Andrew
More information about the SeqFan
mailing list