reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
G.f.: Sum_{k>=1} x^binomial(k,2)/Product_{j=1..k-1} (1 - x^(binomial(k,2)-binomial(j,2))). - Andrew Howroyd, Jan 22 2023
(PARI) seq(n)={Vec(sum(k=1, (sqrtint(8*n+1)+1)\2, my(t=binomial(k, 2)); x^t/prod(j=1, k-1, 1 - x^(t-binomial(j, 2)) + O(x^(n-t+1)))))} \\ Andrew Howroyd, Jan 22 2023
approved
editing
proposed
approved
editing
proposed
Also Equivalently, a(n) is the number of multisets (weakly increasing sequences of positive integers whose prime indices have ) with weighted sum n. For example, the Heinz numbers of the a(0) = 1 through a(15) = 7 numbers multisets are:
These multisets are ranked counted by A264034. The reverse version is A007294. The zero-based version is A359678.
A359497 gives maximum max for given weighted sum of prime indices, zero-based A359757.
A359682 gives minimum min for given weighted sum of prime indices, zero-based A359676 (reverse A359681).
A359755 gives first positions for weighted sums of prime indices, reverse rev A359754.
`Cf. A000009, A029931, A243055, A264034, `A325362, ~`A355536, ~`A358133, A358136, A358137, A358194, `A359361, A359397, A359674, A359675, A359677, A359678, `A359680A359681.