[seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes

[Vladeta Jovovic]

It is not difficult to prove that 

A007126(n) = A000088(n-1) - Sum_{k=1..n-1} A007126(k)*A002854(n-k), n>1, with A007126(1) =1,



which is equivalent to the stated conjecture.



V.