Number of simple unlabeled graphs on n nodes with exactly 10 connected components that are trees or cycles.

A215980

Number of simple unlabeled graphs on n nodes with exactly 10 connected components that are trees or cycles.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =6a(4) =13a(5) =26a(6) =56a(7) =115a(8) =247a(9) =533a(10) =1175a(11) =2635a(12) =6037a(13) =14069a(14) =33378a(15) =80466a(16) =196759a(17) =487453a(18) =1221515a(19) =3092719a(20) =7901816a(21) =20354765a(22) =52815434a(23) =137946253a(24) =362430959a(25) =957359614a(26) =2541249138a(27) =6775848932a(28) =18141119582a(29) =48753971355

External references