Number of unlabeled forests with n nodes that have two components, neither of which is the empty graph.

A274938

Number of unlabeled forests with n nodes that have two components, neither of which is the empty graph.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =1a(4) =1a(5) =3a(6) =5a(7) =11a(8) =21a(9) =46a(10) =96a(11) =216a(12) =482a(13) =1121a(14) =2633a(15) =6334a(16) =15414a(17) =38132a(18) =95321a(19) =241029a(20) =614862a(21) =1582030a(22) =4099922a(23) =10697038a(24) =28074752a(25) =74086468a(26) =196469601a(27) =523383136a(28) =1400048426a(29) =3759508536

External references