The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors.
A199394
The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors.
Terms
- a(0) =11a(1) =90a(2) =357a(3) =996a(4) =2255a(5) =4446a(6) =7945a(7) =13192a(8) =20691a(9) =31010a(10) =44781a(11) =62700a(12) =85527a(13) =114086a(14) =149265a(15) =192016a(16) =243355a(17) =304362a(18) =376181a(19) =460020a(20) =557151a(21) =668910a(22) =796697a(23) =941976a(24) =1106275a(25) =1291186a(26) =1498365a(27) =1729532a(28) =1986471a(29) =2271030
External references
- oeis: A199394