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

A215989

Number of simple unlabeled graphs on n nodes with exactly 9 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) =1174a(11) =2633a(12) =6031a(13) =14055a(14) =33343a(15) =80386a(16) =196569a(17) =487017a(18) =1220491a(19) =3090331a(20) =7896160a(21) =20341323a(22) =52783053a(23) =137867631a(24) =362237861a(25) =956881142a(26) =2540051927a(27) =6772828374a(28) =18133435767a(29) =48734282113

External references