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

A369744 a(n) = Sum_{p|n, p prime} p * omega(n/p).

Original entry on oeis.org

0, 0, 0, 2, 0, 5, 0, 2, 3, 7, 0, 7, 0, 9, 8, 2, 0, 8, 0, 9, 10, 13, 0, 7, 5, 15, 3, 11, 0, 20, 0, 2, 14, 19, 12, 10, 0, 21, 16, 9, 0, 24, 0, 15, 11, 25, 0, 7, 7, 12, 20, 17, 0, 8, 16, 11, 22, 31, 0, 22, 0, 33, 13, 2, 18, 32, 0, 21, 26, 28, 0, 10, 0, 39, 13, 23, 18, 36
Offset: 1

Views

Author

Wesley Ivan Hurt, Jan 30 2024

Keywords

Comments

Dirichlet convolution of A061397(n) and A001221(n). - Wesley Ivan Hurt, Apr 24 2025

Links

Crossrefs

Cf. A001221 (omega), A010051, A061397, A323599, A345354, A345355.
Cf. also A369911.

Programs

  • Mathematica
    Table[DivisorSum[n, #*PrimeNu[n/#] &, PrimeQ[#] &], {n, 100}]
  • PARI
    A369744(n) = if(1==n, 0, my(f=factor(n)); sum(i=1, #f~, f[i,1]*omega(n/f[i, 1]))); \\ Antti Karttunen, Jan 23 2025

Formula

a(p^k) = 1 for p prime and k = 1, else p if k >= 2. - Wesley Ivan Hurt, Jun 26 2024
a(n) = Sum_{d|n} d * omega(n/d) * c(d), where c = A010051. - Wesley Ivan Hurt, Apr 15 2025

A369912 a(n) = Sum_{p|n, p prime} p^sopf(n/p).

Original entry on oeis.org

0, 1, 1, 4, 1, 17, 1, 4, 27, 57, 1, 41, 1, 177, 368, 4, 1, 251, 1, 153, 2530, 2169, 1, 41, 3125, 8361, 27, 561, 1, 5568, 1, 4, 178478, 131361, 94932, 275, 1, 524649, 1596520, 153, 1, 37514, 1, 8313, 6686, 8389137, 1, 41, 823543, 78157, 129145076, 32937, 1, 251
Offset: 1

Views

Author

Wesley Ivan Hurt, Feb 05 2024

Keywords

Crossrefs

Cf. A008472 (sopf), A369744, A369911, A369913.

Programs

  • Mathematica
    a[n_] := Sum[p, {p, Select[Divisors[n], PrimeQ]}]; Table[DivisorSum[n, #^a[n/#] &, PrimeQ[#] &], {n, 80}]

Formula

a(p^k) = p^(p-p*floor(1/k)) for p prime and k>=1. - Wesley Ivan Hurt, Jul 09 2025

A369913 a(n) = Sum_{p|n, p prime} n^sopf(n/p).

Original entry on oeis.org

0, 1, 1, 16, 1, 252, 1, 64, 729, 100100, 1, 248976, 1, 105413700, 762750, 256, 1, 1895400, 1, 1280000400, 1801097802, 584318301411812, 1, 7963200, 9765625, 2481152873203737252, 19683, 10578455954192, 1, 677994300000, 1, 1024, 50542106513762754
Offset: 1

Views

Author

Wesley Ivan Hurt, Feb 05 2024

Keywords

Crossrefs

Cf. A008472 (sopf), A369744, A369911, A369912.

Programs

  • Mathematica
    a[n_] := Sum[p, {p, Select[Divisors[n], PrimeQ]}]; Table[DivisorSum[n, n^a[n/#] &, PrimeQ[#] &], {n, 40}]

Formula

a(p^k) = p^(p*(k-floor(1/k))) for p prime and k>=1. - Wesley Ivan Hurt, Jul 09 2025

A369914 a(n) = n * Sum_{p|n, p prime} sopf(n/p) / p.

Original entry on oeis.org

0, 0, 0, 4, 0, 13, 0, 8, 9, 29, 0, 38, 0, 53, 34, 16, 0, 57, 0, 78, 58, 125, 0, 76, 25, 173, 27, 134, 0, 220, 0, 32, 130, 293, 74, 150, 0, 365, 178, 156, 0, 366, 0, 294, 147, 533, 0, 152, 49, 195, 298, 398, 0, 171, 146, 268, 370, 845, 0, 500, 0, 965, 237, 64, 194
Offset: 1

Views

Author

Wesley Ivan Hurt, Feb 05 2024

Keywords

Comments

Dirichlet convolution of c(n) and n * sopf(n), where c = A010051. - Wesley Ivan Hurt, Jul 10 2025

Crossrefs

Cf. A008472 (sopf), A010051, A369744, A369911, A369912, A369913.

Programs

  • Mathematica
    a[n_] := Sum[p, {p, Select[Divisors[n], PrimeQ]}]; Table[n*DivisorSum[n, a[n/#]/# &, PrimeQ[#] &], {n, 80}]

Formula

a(p^k) = p^k * (1 - floor(1/k)) for p prime and k>=1. - Wesley Ivan Hurt, Jul 09 2025
a(n) = n * Sum_{d|n} c(d) * sopf(n/d) / d, where c = A010051. - Wesley Ivan Hurt, Jul 10 2025
Showing 1-4 of 4 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.