OFFSET
0,4
COMMENTS
Same as A126100 except that the root node may not be a cut node, i.e., a node whose removal would disconnect the graph.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..50
PROG
(PARI) \\ See A126100 for g; InvEulerT takes inverse Euler transform.
InvEulerT(v)={my(p=log(1+x*Ser(v))); dirdiv(vector(#v, n, polcoef(p, n)), vector(#v, n, 1/n))}
seq(n)={concat([1, 1], InvEulerT(Vec(-1+Ser(vector(n, n, g(n-1, 1)))/Ser(vector(n, n, g(n-1, 0))))))} \\ Andrew Howroyd, Nov 23 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
David Applegate and N. J. A. Sloane, Mar 06 2007
EXTENSIONS
a(6)-a(10) computed by Gordon F. Royle, Mar 05 2007
a(11)-a(19) computed by David Applegate from A126100, Mar 07 2007
a(15)-a(18) corrected and terms a(20) and beyond from Andrew Howroyd, Nov 23 2020
STATUS
approved