Triangle read by rows: T(n,k) is the number of k-colored graphs on n nodes with restricted labels, n>=0, 0<=k<=n.
A335330
Triangle read by rows: T(n,k) is the number of k-colored graphs on n nodes with restricted labels, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =2a(6) =0a(7) =1a(8) =8a(9) =8a(10) =0a(11) =1a(12) =32a(13) =96a(14) =64a(15) =0a(16) =1a(17) =160a(18) =1152a(19) =2048a(20) =1024a(21) =0a(22) =1a(23) =1088a(24) =17920a(25) =65536a(26) =81920a(27) =32768a(28) =0a(29) =1
External references
- oeis: A335330