Number of spanning trees in the k_1 X ... X k_j grid graph, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.
A338832
Number of spanning trees in the k_1 X ... X k_j grid graph, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =1a(5) =15a(6) =1a(7) =384a(8) =192a(9) =56a(10) =1a(11) =31500a(12) =1a(13) =209a(14) =2415a(15) =42467328a(16) =1a(17) =49766400a(18) =1a(19) =2558976a(20) =30305a(21) =780a(22) =1a(24) =100352a(25) =2911a(27) =207746836a(28) =1a(29) =76752081000a(30) =1a(32) =380160
External references
- oeis: A338832