Q. about triangle A106239 (graphs with unicyclic components)

[Maximilian Hasler]

>  Can someone explain what this sequence is showing? Vladeta?

The definition should mention that
the table is to be read as upper right triangle (to avoid even more 0's),
so the cited value is correct and the slope is -1/3 as it should be.
(but I won't comment on other table formatting issues here...)
M.H.

>  %N A106239 Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.
>  The other day Tom Zaslavsky, zaslav at math.binghamton.edu, wrote to me saying:
>  %N A106239 T(n,m) = # of simple graphs on n labeled nodes with m components, each component being unicyclic (one cycle).
>  The largest possible number of components is floor(n/3), so T(5,2) = 0, but the table shows 10.
>  The nonzero lower boundary should have slope -1/3, but its slope is -1/2.