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

A348510 a(n) = A099377(n) - n, where A099377(n) is the numerator of the harmonic mean of the divisors of n.

Original entry on oeis.org

0, 2, 0, 8, 0, -4, 0, 24, 18, 10, 0, 6, 0, -7, -10, 64, 0, 18, 0, 0, 0, 0, 0, -8, 50, 26, 0, -25, 0, -20, 0, 32, -22, 34, 0, 288, 0, 0, 0, -8, 0, -35, 0, -22, 0, -23, 0, 72, 0, 50, -34, 104, 0, -36, 0, 0, 0, 58, 0, -30, 0, -31, 126, 384, 0, -55, 0, 0, -46, -35, 0, 216, 0, 74, 150, 38, 0, -52, 0, 320, 324, 82, 0, -75
Offset: 1

Views

Author

Antti Karttunen, Oct 31 2021

Keywords

Crossrefs

Cf. A099377, A250094 (positions of zeros), A348968, A348969.

Programs

  • Mathematica
    a[n_] := Numerator[DivisorSigma[0, n]/DivisorSigma[-1, n]] - n; Array[a, 100] (* Amiram Eldar, Oct 31 2021 *)
  • PARI
    A099377(n) = { my(d=divisors(n)); numerator(#d/sum(k=1, #d, 1/d[k])); }; \\  From A099377
    A348510(n) = (A099377(n)-n);

A348968 a(n) = gcd(n, A099377(n)), where A099377(n) is the numerator of the harmonic mean of the divisors of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 2, 7, 8, 9, 10, 11, 6, 13, 7, 5, 16, 17, 18, 19, 20, 21, 22, 23, 8, 25, 26, 27, 1, 29, 10, 31, 32, 11, 34, 35, 36, 37, 38, 39, 8, 41, 7, 43, 22, 45, 23, 47, 24, 49, 50, 17, 52, 53, 18, 55, 56, 57, 58, 59, 30, 61, 31, 63, 64, 65, 11, 67, 68, 23, 35, 71, 72, 73, 74, 75, 38, 77, 26, 79, 80, 81, 82, 83, 3
Offset: 1

Views

Author

Antti Karttunen, Nov 05 2021

Keywords

Crossrefs

Programs

  • PARI
    A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    A099377(n) = { my(d=divisors(n)); numerator(#d/sum(k=1, #d, 1/d[k])); }; \\ From A099377
    A348968(n) = gcd(n, A099377(n));

Formula

a(n) = gcd(n, A099377(n)) = gcd(n, A348510(n)) = gcd(A099377(n), A348510(n)).
a(n) = n / A348969(n).
a(n) = A099377(n) / A057021(n). [Apparently, holds at least up to n = 2^25]
Showing 1-2 of 2 results.