cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 10 results.

A341123 Number of partitions of n into 5 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 9, 11, 15, 17, 23, 25, 32, 34, 42, 45, 55, 56, 68, 71, 83, 84, 100, 100, 117, 118, 136, 135, 158, 153, 179, 178, 204, 200, 234, 226, 261, 255, 291, 283, 327, 310, 357, 344, 390, 371, 430, 405, 466, 444, 505, 476, 550, 511, 589, 557, 634, 589, 684, 629
Offset: 5

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341122, A341124, A341125, A341126, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 5):
seq(a(n), n=5..64);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 5];
Table[a[n], {n, 5, 64}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A341122 Number of partitions of n into 4 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 5, 8, 9, 12, 13, 17, 17, 22, 22, 26, 27, 33, 31, 39, 38, 44, 43, 51, 47, 58, 54, 63, 60, 71, 64, 79, 74, 88, 82, 99, 88, 108, 97, 116, 105, 126, 110, 134, 119, 141, 126, 153, 133, 164, 143, 172, 149, 184, 155, 194, 168, 204, 173, 215, 180, 227, 192, 238
Offset: 4

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341123, A341124, A341125, A341126, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 4):
seq(a(n), n=4..66);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 4];
Table[a[n], {n, 4, 66}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A341112 Number of partitions of n into 3 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 6, 6, 8, 8, 10, 9, 12, 10, 13, 12, 15, 13, 17, 15, 18, 15, 19, 16, 21, 17, 23, 18, 24, 19, 27, 23, 30, 24, 32, 25, 32, 26, 34, 26, 36, 26, 36, 28, 38, 28, 40, 30, 42, 32, 43, 30, 45, 32, 47, 35, 49, 30, 50, 35, 51, 36, 53, 35, 55, 37, 54, 40, 57, 36, 61, 40, 61
Offset: 3

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A282064, A307727, A307825, A341122, A341123, A341124, A341125, A341126, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 3):
seq(a(n), n=3..75);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 3];
Table[a[n], {n, 3, 75}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A341125 Number of partitions of n into 7 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 10, 13, 18, 22, 30, 35, 47, 54, 68, 78, 97, 107, 132, 146, 173, 190, 225, 242, 285, 305, 352, 377, 434, 456, 525, 553, 627, 659, 748, 778, 881, 916, 1028, 1068, 1197, 1232, 1381, 1421, 1578, 1619, 1801, 1837, 2041, 2079, 2296, 2337, 2583, 2613
Offset: 7

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341122, A341123, A341124, A341126, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 7):
seq(a(n), n=7..60);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 7];
Table[a[n], {n, 7, 60}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A341126 Number of partitions of n into 8 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 10, 13, 19, 23, 32, 38, 51, 60, 77, 90, 113, 128, 158, 179, 215, 240, 287, 316, 373, 409, 475, 517, 599, 645, 741, 799, 908, 971, 1104, 1173, 1326, 1408, 1580, 1670, 1874, 1967, 2198, 2310, 2563, 2680, 2976, 3097, 3426, 3566, 3926, 4070, 4485
Offset: 8

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341122, A341123, A341124, A341125, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 8):
seq(a(n), n=8..60);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 8];
Table[a[n], {n, 8, 60}] (* Jean-François Alcover, Feb 22 2022, after _Alois P. Heinz *)

A341127 Number of partitions of n into 9 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 10, 13, 19, 24, 33, 40, 54, 64, 83, 99, 125, 144, 180, 206, 250, 284, 341, 383, 455, 506, 593, 656, 762, 835, 965, 1054, 1206, 1309, 1491, 1610, 1825, 1964, 2213, 2374, 2664, 2843, 3179, 3387, 3769, 3998, 4440, 4695, 5194, 5480, 6043, 6357
Offset: 9

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341122, A341123, A341124, A341125, A341126.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 9):
seq(a(n), n=9..60);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 9];
Table[a[n], {n, 9, 60}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A341135 Number of ways to write n as an ordered sum of 6 prime powers (including 1).

Original entry on oeis.org

1, 6, 21, 56, 126, 246, 432, 702, 1077, 1576, 2232, 3072, 4118, 5382, 6891, 8638, 10653, 12948, 15563, 18486, 21783, 25398, 29394, 33708, 38422, 43452, 49008, 54888, 61308, 68076, 75434, 83034, 91473, 100248, 109947, 120018, 131191, 142458, 155049, 167622, 181629, 195660
Offset: 6

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341124, A341133, A341134, A341136, A341137, A341138, A341139.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, t) option remember;
      `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add(
      `if`(q(j), b(n-j, t-1), 0), j=1..n)))
    end:
a:= n-> b(n, 6):
seq(a(n), n=6..47);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 47; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^6, {x, 0, nmax}], x] // Drop[#, 6] &

A341143 Number of partitions of n into 6 distinct prime powers (including 1).

Original entry on oeis.org

1, 1, 1, 1, 3, 3, 5, 5, 7, 8, 10, 10, 16, 16, 20, 22, 28, 27, 35, 36, 44, 47, 56, 57, 70, 72, 81, 89, 102, 105, 122, 128, 140, 151, 167, 175, 197, 208, 223, 241, 259, 272, 296, 316, 331, 359, 378, 400, 423, 452, 468, 507, 525, 556, 580, 619, 631, 684, 701, 748
Offset: 22

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A341124, A341132, A341135, A341140, A341141, A341142, A341144, A341145.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i-1), t-1), 0)))
    end:
a:= n-> b(n$2, 6):
seq(a(n), n=22..81);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i - 1], t - 1], 0]]];
a[n_] := b[n, n, 6];
Table[a[n], {n, 22, 81}] (* Jean-François Alcover, Feb 22 2022, after Alois P. Heinz *)

A347647 Number of partitions of n into at most 6 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 10, 13, 18, 23, 29, 36, 45, 54, 64, 75, 89, 102, 118, 133, 152, 170, 191, 210, 236, 257, 284, 309, 340, 366, 401, 428, 469, 499, 543, 575, 628, 661, 717, 753, 816, 853, 922, 961, 1035, 1076, 1155, 1195, 1284, 1324, 1417, 1460, 1564, 1604, 1717, 1755
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 09 2021

Keywords

Crossrefs

Cf. A000961, A023893, A341124, A347643, A347644, A347645, A347646.

A341131 Number of partitions of n into 10 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 3, 5, 6, 10, 13, 19, 24, 34, 41, 56, 67, 87, 105, 134, 156, 196, 228, 278, 320, 387, 439, 526, 593, 698, 783, 915, 1014, 1179, 1304, 1497, 1648, 1884, 2058, 2342, 2551, 2882, 3130, 3524, 3802, 4266, 4595, 5125, 5504, 6124, 6548, 7263, 7750, 8558
Offset: 10

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A071330, A341112, A341122, A341123, A341124, A341125, A341126, A341127.

Programs

  • Maple
    q:= proc(n) option remember; nops(ifactors(n)[2])<2 end:
b:= proc(n, i, t) option remember; `if`(n=0,
      `if`(t=0, 1, 0), `if`(i<1 or t<1, 0, b(n, i-1, t)+
      `if`(q(i), b(n-i, min(n-i, i), t-1), 0)))
    end:
a:= n-> b(n$2, 10):
seq(a(n), n=10..60);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = Length[FactorInteger[n]] < 2;
b[n_, i_, t_] := b[n, i, t] = If[n == 0,
     If[t == 0, 1, 0], If[i < 1 || t < 1, 0, b[n, i - 1, t] +
     If[q[i], b[n - i, Min[n - i, i], t - 1], 0]]];
a[n_] := b[n, n, 10];
Table[a[n], {n, 10, 60}] (* Jean-François Alcover, Feb 27 2022, after Alois P. Heinz *)
Showing 1-10 of 10 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.