A341980 -id:A341980 - cp's OEIS frontend

A341978 Number of partitions of n into 7 distinct primes (counting 1 as a prime).

1, 0, 0, 0, 1, 0, 2, 0, 1, 0, 2, 0, 4, 0, 2, 1, 6, 1, 7, 0, 5, 2, 8, 1, 11, 1, 10, 4, 15, 3, 18, 3, 17, 7, 22, 6, 28, 6, 25, 11, 35, 11, 40, 11, 38, 19, 50, 18, 56, 18, 54, 30, 70, 28, 74, 30, 78, 45, 92, 40, 100, 46, 104, 63, 123, 60, 133, 69, 140, 88, 157, 86, 173

Offset: 42

Ilya Gutkovskiy, Feb 24 2021

nonn

Alois P. Heinz, Table of n, a(n) for n = 42..10000

Cf. A008578, A036497, A219201, A341950, A341973, A341974, A341975, A341976, A341977, A341979, A341980, A341981.

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, 8)
    end:
a:= n-> coeff(b(n, numtheory[pi](n)), x, 7):
seq(a(n), n=42..114);  # 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, 8}];
a[n_] := Coefficient[b[n, PrimePi[n]], x, 7];
Table[a[n], {n, 42, 114}] (* Jean-François Alcover, Feb 24 2022, after Alois P. Heinz *)

A341979 Number of partitions of n into 8 distinct primes (counting 1 as a prime).

Original entry on oeis.org

1, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 4, 0, 3, 0, 3, 1, 7, 0, 6, 1, 6, 1, 11, 0, 11, 2, 11, 3, 19, 1, 18, 3, 18, 5, 30, 4, 28, 6, 30, 10, 45, 6, 40, 11, 46, 16, 63, 11, 60, 19, 69, 25, 88, 18, 86, 32, 97, 36, 121, 32, 123, 47, 131, 55, 164, 49, 164, 69, 181, 80

Offset: 59

Ilya Gutkovskiy, Feb 24 2021

nonn

Cf. A008578, A036497, A219202, A341951, A341973, A341974, A341975, A341976, A341977, A341978, A341980, A341981.

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, 9)
    end:
a:= n-> coeff(b(n, numtheory[pi](n)), x, 8):
seq(a(n), n=59..130);  # 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, 9}];
a[n_] := Coefficient[b[n, PrimePi[n]], x, 8];
Table[a[n], {n, 59, 130}] (* Jean-François Alcover, Feb 24 2022, after Alois P. Heinz *)

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

Original entry on oeis.org

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 *)

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

Original entry on oeis.org

1, 9, 45, 156, 423, 954, 1887, 3384, 5661, 8935, 13446, 19332, 26838, 36126, 47691, 61668, 78696, 98631, 122665, 150516, 184230, 222438, 268146, 318564, 379383, 445572, 525942, 610344, 712872, 817290, 947166, 1075680, 1238148, 1391475, 1591236, 1773684, 2022241

Offset: 9

Ilya Gutkovskiy, Feb 24 2021

nonn

Cf. A008578, A280917, A283762, A340965, A341719, A341980, A341982, A341983, A341984, A341985, A341986, A341987, A341989.

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

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

cp's OEIS Frontend

A341978 Number of partitions of n into 7 distinct primes (counting 1 as a prime).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

A341979 Number of partitions of n into 8 distinct primes (counting 1 as a prime).

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

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

Views

Author

Keywords

Crossrefs

Programs

Maple

Mathematica

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

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula