|
%I #14 Feb 23 2024 20:31:26
%S 1,1,2,6,12,120,1440,40320,1209600,1567641600,2633637888000,
%T 13905608048640000,5046067048690483200000,
%U 5289893008483207348224000000,1266933607446134946465526579200000000,99304891373531545064656621572980736000000000000
%N Product of products of parts over all strict integer partitions of n.
%H Alois P. Heinz, <a href="/A325504/b325504.txt">Table of n, a(n) for n = 0..30</a>
%F A001222(a(n)) = A325515(n).
%F a(n) = A003963(A325506(n)).
%e The strict partitions of 5 are {(5), (4,1), (3,2)} with product a(5) = 5*4*1*3*2 = 120.
%e The sequence of terms together with their prime indices begins:
%e 1: {}
%e 1: {}
%e 2: {1}
%e 6: {1,2}
%e 12: {1,1,2}
%e 120: {1,1,1,2,3}
%e 1440: {1,1,1,1,1,2,2,3}
%e 40320: {1,1,1,1,1,1,1,2,2,3,4}
%e 1209600: {1,1,1,1,1,1,1,1,2,2,2,3,3,4}
%e 1567641600: {1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,3,3,4}
%e 2633637888000: {1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,3,3,3,4,4}
%p a:= n-> mul(i, i=map(x-> x[], select(x->
%p nops(x)=nops({x[]}), combinat[partition](n)))):
%p seq(a(n), n=0..15); # _Alois P. Heinz_, Aug 03 2021
%p # second Maple program:
%p b:= proc(n, i) option remember; `if`(n=0, [1$2], `if`(i<1, [0, 1], ((f, g)->
%p [f[1]+g[1], f[2]*g[2]*i^g[1]])(b(n, i-1), b(n-i, min(n-i, i-1)))))
%p end:
%p a:= n-> b(n$2)[2]:
%p seq(a(n), n=0..15); # _Alois P. Heinz_, Aug 03 2021
%t Table[Times@@Join@@Select[IntegerPartitions[n],UnsameQ@@#&],{n,0,10}]
%Y Cf. A000009, A006128, A007870 (non-strict version), A015723, A022629 (sum of products of parts), A066186, A066189, A066633, A246867, A325505, A325506, A325512, A325513, A325515.
%K nonn
%O 0,3
%A _Gus Wiseman_, May 07 2019
|
