a(n) = number of loopless diagrams by number of K_5 up to all symmetries.

A348820

a(n) = number of loopless diagrams by number of K_5 up to all symmetries.

Terms

    a(0) =0a(1) =1a(2) =42a(3) =112418a(4) =1105696796

External references