Triangular array read by rows. T(n,k) is the number of simple unlabeled graphs with n nodes having exactly k distinct components.
A182223
Triangular array read by rows. T(n,k) is the number of simple unlabeled graphs with n nodes having exactly k distinct components.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =1a(5) =8a(6) =3a(7) =22a(8) =12a(9) =117a(10) =37a(11) =2a(12) =854a(13) =182a(14) =8a(15) =11140a(16) =1163a(17) =43a(18) =261085a(19) =13365a(20) =218a(21) =11716804a(22) =286878a(23) =1474a(24) =12a(25) =1006700566a(26) =12281795a(27) =15449a(28) =54a(29) =164059836867
External references
- oeis: A182223