a(n) is the number of time-dependent assembly trees satisfying the connected gluing rule for a cycle on n vertices.

A317057

a(n) is the number of time-dependent assembly trees satisfying the connected gluing rule for a cycle on n vertices.

Terms

    a(0) =1a(1) =1a(2) =4a(3) =23a(4) =166a(5) =1437a(6) =14512a(7) =167491a(8) =2174746a(9) =31374953a(10) =497909380a(11) =8619976719a(12) =161667969646

External references