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.

A295126 Denominator of Sum_{d|n} mu(n/d)/d, where mu is the Möbius function A008683.

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 6, 13, 7, 15, 16, 17, 9, 19, 5, 7, 11, 23, 12, 25, 13, 27, 14, 29, 15, 31, 32, 33, 17, 35, 18, 37, 19, 13, 10, 41, 7, 43, 22, 45, 23, 47, 24, 49, 25, 51, 13, 53, 27, 11, 28, 19, 29, 59, 15, 61, 31, 21, 64, 65, 33, 67, 17, 69, 35
Offset: 1

Views

Author

Mats Granvik and Robert G. Wilson v, Nov 15 2017

Keywords

Comments

a(n) <= n.
a(n) <> n when n is in A069209.
n == 0 (mod a(n)).
First occurrence of k: 1, 2, 3, 4, 5, 12, 7, 8, 9, 40, 11, 24, 13, 28, 15, 16, 17, 36, 19, 80, 63, 44, 23, 48, 25, ..., ;
First occurrence of k = a(n)/n: 1, 6, 21, 20, 55, 42, 203, 120, 171, 110, 253, 84, 689, 406, 465, 272, 1751, 342, ..., .

Examples

			a(6) = 1 since mu(6)/1 + mu(3)/2 + mu(2)/3 + mu(1)/6 = 1 - 1/2 - 1/3 + 1/6 = 1/3.
		

Crossrefs

Programs

  • Maple
    f:= n -> denom(add(numtheory:-mobius(n/k)/k, k=numtheory:-divisors(n))):
    map(f, [$1..100]); # Robert Israel, Nov 16 2017
  • Mathematica
    f[n_] := Block[{d = Divisors@ n}, Plus @@ (MoebiusMu[d]/Reverse@ d)]; Denominator@ Array[f, 70]
    f[p_, e_] := -(p-1)/p^e; a[1] = 1; a[n_] := Denominator[Times @@ f @@@ FactorInteger[n]]; Array[a, 100] (* Amiram Eldar, Jun 06 2025 *)
  • PARI
    a(n) = denominator(sumdiv(n, d, moebius(n/d)/d)); \\ Michel Marcus, Nov 17 2017