[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Revision History for A024938 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Total number of parts in all partitions of n into distinct prime parts.
(history; published version)
#27 by N. J. A. Sloane at Thu Dec 28 21:27:35 EST 2017
STATUS

proposed

approved

#26 by Andrew Howroyd at Thu Dec 28 21:26:28 EST 2017
STATUS

editing

proposed

#25 by Andrew Howroyd at Thu Dec 28 21:13:46 EST 2017
PROG

(PARI)

sumparts(n, pred)={sum(k=1, n, 1 - 1/(1+pred(k)*x^k) + O(x*x^n))*prod(k=1, n, 1+pred(k)*x^k + O(x*x^n))}

{my(n=60); Vec(sumparts(n, isprime), -n)} \\ Andrew Howroyd, Dec 28 2017

STATUS

approved

editing

#24 by Alois P. Heinz at Sun Dec 27 09:30:49 EST 2015
STATUS

proposed

approved

#23 by Michel Marcus at Sun Dec 27 07:46:23 EST 2015
STATUS

editing

proposed

#22 by Michel Marcus at Sun Dec 27 07:46:13 EST 2015
FORMULA

G.f.: sum(x^p(j)/(1+x^p(j)),j>=1..infinity)*product(1+x^p(j), j>=1..infinity), where p(j) is the j-th prime. - Vladeta Jovovic, Jul 17 2003

STATUS

proposed

editing

#21 by Jean-François Alcover at Sun Dec 27 07:18:43 EST 2015
STATUS

editing

proposed

#20 by Jean-François Alcover at Sun Dec 27 07:18:31 EST 2015
MATHEMATICA

b[n_, i_] := b[n, i] = Module[{g}, If[n==0, {1, 0}, If[i < 1, {0, 0}, g = If[ Prime[i] > n, {0, 0}, b[n - Prime[i], i-1]]; b[n, i-1] + g + {0, g[[1]]}]]]; a[n_] := b[n, PrimePi[n]][[2]]; Table[a[n], {n, 1, 80}] (* Jean-François Alcover, Dec 27 2015, after Alois P. Heinz *)

STATUS

approved

editing

#19 by Alois P. Heinz at Mon Jun 22 18:38:48 EDT 2015
STATUS

editing

approved

#18 by Alois P. Heinz at Mon Jun 22 18:38:45 EDT 2015
FORMULA

G.f.: sum(x^p(j)/(1+x^p(j)),j=1..infinity)*product(1+x^p(j), j=1..infinity), where p(j) is the j-th prime. - _Vladeta Jovovic_

STATUS

approved

editing