Total number of distinct sequences for the number of double occupancy in the underlying Fermion problem (see comment), i.e., the number of distinct hopping sequences (cf. A198761, A225823) in four-colored rooted trees with n nodes, starting and ending with the same coloring in two colors (cf. A198760, corresponding to zero double-occupancy).
A240605
Total number of distinct sequences for the number of double occupancy in the underlying Fermion problem (see comment), i.e., the number of distinct hopping sequences (cf. A198761, A225823) in four-colored rooted trees with n nodes, starting and ending with the same coloring in two colors (cf. A198760, corresponding to zero double-occupancy).
Terms
- a(0) =1a(1) =2a(2) =10a(3) =59a(4) =397a(5) =2878a(6) =21266a(7) =162732a(8) =1253128a(9) =9839212a(10) =77644825a(11) =620377508a(12) =4981522538a(13) =40351448045a(14) =328421827064
External references
- oeis: A240605