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.

A329029 a(n) = A069359(A276086(n)), where A276086 is the primorial base exp-function and A069359(n) = n * Sum_{p|n} 1/p.

Original entry on oeis.org

0, 1, 1, 5, 3, 15, 1, 7, 8, 31, 24, 93, 5, 35, 40, 155, 120, 465, 25, 175, 200, 775, 600, 2325, 125, 875, 1000, 3875, 3000, 11625, 1, 9, 10, 41, 30, 123, 12, 59, 71, 247, 213, 741, 60, 295, 355, 1235, 1065, 3705, 300, 1475, 1775, 6175, 5325, 18525, 1500, 7375, 8875, 30875, 26625, 92625, 7, 63, 70, 287, 210, 861, 84, 413, 497, 1729
Offset: 0

Views

Author

Antti Karttunen, Nov 07 2019

Keywords

Comments

A380535 gives the indices n where a(n) is a multiple of A053669(n). This can be seen from the formula a(n) = A003557(A276086(n)) * A069359(A328571(n)). The left hand side of the product is a multiple of A053669(n) if and only if A276088(n) > 1, while the right hand side is never a multiple of A053669(n), as it is equal to A329031(n) = A003415(A007947(A276086(n))). - Antti Karttunen, Feb 11 2025

Crossrefs

Coincides with A327860 on the positions given by A276156.

Programs

  • PARI
    A329029(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); if(e, m *= (p^e); s += (1/p)); n = n\p; p = nextprime(1+p)); (s*m); };
    
  • PARI
    A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
    A069359(n) = (n*sumdiv(n, d, isprime(d)/d));
    A329029(n) = A069359(A276086(n));

Formula

a(n) = A069359(A276086(n)).
a(n) = A328572(n) * A329031(n) = A003557(A276086(n)) * A069359(A328571(n)). - Antti Karttunen, Feb 11 2025