|
%I #12 Aug 29 2019 16:20:16
%S 0,2,0,3,0,0,0,0,4,0,0,5,0,6,0,0,0,0,0,0,0,9,0,0,8,0,0,0,0,7,0,10,0,0,
%T 0,0,12,0,0,0,0,0,0,0,0,0,0,15,0,0,0,0,0,18,0,0,0,0,16,0,0,0,0,0,0,0,
%U 0,0,14,0,0,0,0,0,0,20,0,27
%N Array of product of parts of the partitions of n with only prime parts.
%C The inverse of sequence A001414 (sopfr(n)=sum of prime factors of n). See the examples and the W. Lang link.
%C The row length sequence of this array is p(n)=A000041(n) (number of partitions).
%C The partitions of n are ordered according to Abramowitz-Stegun (A-St), pp. 831-2.
%C Row n gives the values k for which A001414(k)=n>=2. E.g. n=10 appears 5 times in A001414, namely for the k values 21, 25, 30, 36 and 32.
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards Applied Math. Series 55, Tenth Printing, 1972.
%H W. Lang: <a href="/A116864/a116864.txt">First 10 rows.</a>
%F a(n,k)=product(part(i),i=1..m(n,k)) if the k-th partition of n in the A-St order has only prime parts. Here m(n,k) is the number of parts of this partition. Otherwise a(n,k)=0. See A000040 for the prime numbers.
%e [0];
%e [2, 0];
%e [3, 0, 0];
%e [0, 0, 4, 0, 0];
%e [5, 0, 6, 0, 0, 0, 0];
%e ...
%e a(4,3)=4 because the third partition of 4 is, in A-St order, (2,2)
%e with product 4. There is only this partition of 4 with only prime parts.
%e Row n=5 shows: n=5 appears twice in A001414(k), namely for k= 5 and
%e 6. This is related to the two partitions (5) and (3,2) with only prime parts.
%Y Row sums give A002098(n), n>=1.
%Y Row sums (with nonzero numbers replaced by 1) give A000607(n), n>=1. See the array A116865.
%K nonn,easy,tabf
%O 1,2
%A _Wolfdieter Lang_, Mar 24 2006
|
