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-8 of 8 results.

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

Original entry on oeis.org

1, 1, 1, 2, 3, 4, 5, 7, 7, 9, 9, 11, 12, 15, 15, 19, 18, 21, 21, 26, 25, 30, 29, 35, 32, 39, 37, 45, 43, 52, 50, 58, 54, 62, 61, 71, 66, 75, 74, 81, 78, 89, 85, 96, 93, 102, 99, 110, 103, 115, 117, 122, 120, 131, 127, 136, 136, 139, 142, 153, 147, 154, 160, 163, 165, 177, 175
Offset: 10

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A341122, A341132, A341133, A341140, A341142, A341143, 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, 4):
seq(a(n), n=10..76);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    q[n_] := q[n] = PrimeNu[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, 4];
Table[a[n], {n, 10, 76}] (* Jean-François Alcover, Jul 13 2021, after Alois P. Heinz *)

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

Original entry on oeis.org

1, 5, 15, 35, 70, 121, 190, 280, 395, 535, 711, 920, 1160, 1425, 1725, 2041, 2395, 2775, 3200, 3645, 4146, 4640, 5190, 5730, 6325, 6915, 7625, 8270, 9030, 9745, 10576, 11320, 12320, 13185, 14305, 15281, 16510, 17480, 18855, 19835, 21306, 22435, 24010, 25025, 26810, 27790, 29590
Offset: 5

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341123, A341133, A341135, 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, 5):
seq(a(n), n=5..51);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 51; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^5, {x, 0, nmax}], x] // Drop[#, 5] &

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] &

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

Original entry on oeis.org

1, 9, 45, 165, 495, 1278, 2931, 6111, 11790, 21331, 36594, 60057, 94938, 145296, 216153, 313524, 444483, 617229, 841225, 1127187, 1487322, 1935252, 2486124, 3156408, 3964218, 4928841, 6071472, 7414669, 8983179, 10802970, 12902661, 15311277, 18061092, 21185103, 24720552
Offset: 9

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Links

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341127, A341133, A341134, A341135, A341136, A341137, 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, 9):
seq(a(n), n=9..43);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 43; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^9, {x, 0, nmax}], x] // Drop[#, 9] &

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

Original entry on oeis.org

1, 7, 28, 84, 210, 455, 882, 1569, 2611, 4116, 6223, 9093, 12901, 17822, 24053, 31759, 41132, 52367, 65702, 81326, 99526, 120471, 144417, 171493, 201985, 235963, 273889, 315805, 362181, 413021, 468888, 529466, 595770, 667541, 745899, 830473, 922866, 1021832, 1129499
Offset: 7

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341125, A341133, A341134, A341135, 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, 7):
seq(a(n), n=7..45);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 45; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^7, {x, 0, nmax}], x] // Drop[#, 7] &

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

Original entry on oeis.org

1, 8, 36, 120, 330, 784, 1660, 3208, 5763, 9752, 15724, 24368, 36520, 53152, 75392, 104464, 141717, 188624, 246836, 318088, 404356, 507656, 630172, 774048, 941685, 1135304, 1357652, 1611240, 1899138, 2224016, 2589352, 2997544, 3452619, 3957480, 4516912, 5134096, 5815338
Offset: 8

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341126, A341133, A341134, A341135, A341136, 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, 8):
seq(a(n), n=8..44);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 44; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^8, {x, 0, nmax}], x] // Drop[#, 8] &

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

Original entry on oeis.org

1, 10, 55, 220, 715, 1992, 4915, 10990, 22660, 43660, 79463, 137830, 229460, 368710, 574410, 870644, 1287545, 1862110, 2639135, 3672050, 5024035, 6768950, 8992340, 11792070, 15279450, 19579514, 24832415, 31193900, 38837085, 47952400, 58750125, 71458860, 86328885
Offset: 10

Views

Author

Ilya Gutkovskiy, Feb 05 2021

Keywords

Crossrefs

Cf. A000961, A010055, A282062, A282064, A341131, A341133, A341134, A341135, A341136, A341137, A341138.

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, 10):
seq(a(n), n=10..42);  # Alois P. Heinz, Feb 05 2021
  • Mathematica
    nmax = 42; CoefficientList[Series[Sum[Boole[PrimePowerQ[k] || k == 1] x^k, {k, 1, nmax}]^10, {x, 0, nmax}], x] // Drop[#, 10] &

A347764 Number of compositions (ordered partitions) of n into at most 4 prime powers (including 1).

Original entry on oeis.org

1, 1, 2, 4, 8, 15, 25, 40, 59, 81, 106, 136, 170, 208, 251, 294, 339, 383, 431, 476, 530, 583, 642, 696, 757, 804, 866, 914, 980, 1041, 1125, 1167, 1256, 1312, 1405, 1466, 1598, 1657, 1790, 1840, 1961, 2004, 2148, 2160, 2335, 2365, 2505, 2502, 2707, 2664, 2884
Offset: 0

Views

Author

Ilya Gutkovskiy, Sep 12 2021

Keywords

Crossrefs

Cf. A000961, A280543, A341133, A347762, A347763.

Programs

  • Mathematica
    Table[Length@Flatten[Permutations/@IntegerPartitions[n,4,Join[{1},Select[Range@n,PrimePowerQ]]],1],{n,0,50}] (* Giorgos Kalogeropoulos, Sep 12 2021 *)
Showing 1-8 of 8 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.