[seqfan] Re: A200000
Alonso Del Arte
alonso.delarte at gmail.com
Tue Nov 15 16:59:02 CET 2011
On Tue, Nov 15, 2011 at 12:00 AM, Andrew Weimholt
...
>
>
> a(n) = Minimum number of nodes for a graph with exactly n cycles (of any
> length)
>
> 0, 3, 5, 4, 6, 8, 5, 4, 6, 8, 6, 6, 5, 5, 6, 6, 8, 7, 6, 6, 6, 6,
> 5, 6, 6, 7, 7, 7, 7, 7, 6, 7, 6
>
>
I like that one and I am indeed surprised it's not already in the OEIS,
since it seems to me like there are tons of sequences in the OEIS dealing
with nodes and graphs.
Al
More information about the SeqFan
mailing list