a(n) is the sum of the fill times of all 1-dimensional fountains given by the permutations in S_n.
A321853
a(n) is the sum of the fill times of all 1-dimensional fountains given by the permutations in S_n.
Terms
- a(0) =0a(1) =1a(2) =10a(3) =86a(4) =756a(5) =7092a(6) =71856a(7) =787824a(8) =9329760a(9) =118956960a(10) =1627067520a(11) =23786386560a(12) =370371536640
External references
- oeis: A321853