%I #7 Feb 02 2024 19:22:50
%S 1,1,15,455,20475,1220499,90612753,8055867105,834505143615,
%T 98716154311775,13130233759131489,1939826433518297961,
%U 315169336802124178465,55852728904993187133225,10721612205253023622081875,2216303140328629150998750435,490841301461498403844464646155
%N Number of simple graphs on 2n labeled nodes with n edges where each maximally connected subgraph has at most one cycle.
%C All terms are odd.
%H Alois P. Heinz, <a href="/A369828/b369828.txt">Table of n, a(n) for n = 0..310</a>
%F a(n) = A144228(2n,n).
%Y Cf. A144228.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Feb 02 2024