A341972 -id:A341972 - cp's OEIS frontend

A341981 Number of partitions of n into 10 distinct primes (counting 1 as a prime).

1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 5, 0, 4, 0, 2, 0, 9, 0, 7, 1, 7, 1, 14, 0, 10, 0, 12, 2, 22, 0, 19, 2, 22, 3, 34, 1, 31, 4, 32, 5, 54, 3, 48, 7, 50, 9, 78, 7, 70, 11, 76, 16, 113, 9, 100, 19, 114, 26, 155, 17, 147, 32, 164, 37, 212, 26

Offset: 101

Ilya Gutkovskiy, Feb 24 2021

nonn

Cf. A008578, A036497, A219204, A341972, A341973, A341974, A341975, A341976, A341977, A341978, A341979, A341980.

b:= proc(n, i) option remember; series(`if`(n=0, 1,
     `if`(i<0, 0, (p-> `if`(p>n, 0, x*b(n-p, i-1)))(
     `if`(i=0, 1, ithprime(i)))+b(n, i-1))), x, 11)
    end:
a:= n-> coeff(b(n, numtheory[pi](n)), x, 10):
seq(a(n), n=101..174);  # Alois P. Heinz, Feb 24 2021

b[n_, i_] := b[n, i] = Series[If[n == 0, 1,
     If[i < 0, 0, Function[p, If[p > n, 0, x*b[n - p, i - 1]]][
     If[i == 0, 1, Prime[i]]] + b[n, i - 1]]], {x, 0, 11}];
a[n_] := Coefficient[b[n, PrimePi[n]], x, 10];
Table[a[n], {n, 101, 174}] (* Jean-François Alcover, Feb 24 2022, after Alois P. Heinz *)

A341989 Number of ways to write n as an ordered sum of 10 primes (counting 1 as a prime).

Original entry on oeis.org

1, 10, 55, 210, 625, 1542, 3310, 6390, 11400, 19090, 30353, 46060, 67210, 94780, 130230, 174862, 230650, 298800, 382115, 482090, 603373, 746860, 918770, 1118100, 1355110, 1626742, 1949190, 2312380, 2740220, 3212640, 3769784, 4375900, 5092485, 5854680, 6758935, 7703112

Offset: 10

Ilya Gutkovskiy, Feb 24 2021

nonn

Cf. A008578, A280917, A283762, A340966, A341972, A341981, A341982, A341983, A341984, A341985, A341986, A341987, A341988.

b:= proc(n) option remember; series(`if`(n=0, 1, x*add(
      `if`(j=1 or isprime(j), b(n-j), 0), j=1..n)), x, 11)
    end:
a:= n-> coeff(b(n), x, 10):
seq(a(n), n=10..45);  # Alois P. Heinz, Feb 25 2021

nmax = 45; CoefficientList[Series[(x + Sum[x^Prime[k], {k, 1, nmax}])^10, {x, 0, nmax}], x] // Drop[#, 10] &

G.f.: ( x + Sum_{k>=1} x^prime(k) )^10.

A341719 Number of partitions of n into 9 primes (counting 1 as a prime).

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 7, 7, 11, 11, 16, 15, 23, 21, 30, 27, 39, 35, 51, 44, 63, 54, 78, 67, 97, 81, 116, 96, 139, 115, 166, 133, 194, 155, 227, 180, 265, 206, 305, 236, 351, 271, 403, 305, 460, 346, 522, 391, 592, 438, 668, 489, 751, 551, 844, 608, 942, 674, 1050, 750

Offset: 9

Ilya Gutkovskiy, Feb 24 2021

nonn

Cf. A008578, A034891, A259200, A341945, A341946, A341947, A341948, A341949, A341950, A341951, A341972.

b:= proc(n, i) option remember; series(`if`(n=0, 1,
     `if`(i<0, 0, (p-> `if`(p>n, 0, x*b(n-p, i)))(
     `if`(i=0, 1, ithprime(i)))+b(n, i-1))), x, 10)
    end:
a:= n-> coeff(b(n, numtheory[pi](n)), x, 9):
seq(a(n), n=9..68);  # Alois P. Heinz, Feb 24 2021

b[n_, i_] := b[n, i] = Series[If[n == 0, 1,
     If[i < 0, 0, Function[p, If[p > n, 0, x*b[n - p, i]]][
     If[i == 0, 1, Prime[i]]] + b[n, i - 1]]], {x, 0, 10}];
a[n_] := Coefficient[b[n, PrimePi[n]], x, 9];
Table[a[n], {n, 9, 68}] (* Jean-François Alcover, Feb 26 2022, after Alois P. Heinz *)

cp's OEIS Frontend

A341981 Number of partitions of n into 10 distinct primes (counting 1 as a prime).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

A341989 Number of ways to write n as an ordered sum of 10 primes (counting 1 as a prime).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

Formula

A341719 Number of partitions of n into 9 primes (counting 1 as a prime).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica