Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i odd} (j_i)^2.
A151884
Let g be a permutation of [1..n] having say j_i cycles of length i, with Sum_i i*j_i = n; sequence gives Sum_g Sum_{i odd} (j_i)^2.
Terms
- a(0) =1a(1) =4a(2) =14a(3) =56a(4) =304a(5) =1904a(6) =14048a(7) =112384a(8) =1051776a(9) =10662912a(10) =120920832a(11) =1451049984a(12) =19342651392a(13) =272576268288
External references
- oeis: A151884