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

A318879 a(n) = Sum_{d|n} [d-(2*phi(d)) > 0]*(d-(2*phi(d))).

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 6, 0, 2, 0, 0, 0, 8, 0, 6, 0, 2, 0, 14, 0, 2, 0, 6, 0, 18, 0, 0, 0, 2, 0, 24, 0, 2, 0, 14, 0, 22, 0, 6, 0, 2, 0, 30, 0, 12, 0, 6, 0, 26, 0, 14, 0, 2, 0, 54, 0, 2, 0, 0, 0, 30, 0, 6, 0, 26, 0, 56, 0, 2, 0, 6, 0, 34, 0, 30, 0, 2, 0, 66, 0, 2, 0, 14, 0, 66, 0, 6, 0, 2, 0, 62, 0, 16, 0, 36, 0, 42, 0, 14, 9
Offset: 1

Views

Author

Antti Karttunen, Sep 05 2018

Keywords

Examples

			n = 105 has divisors [1, 3, 5, 7, 15, 21, 35, 105]. When A083254 is applied to them, we obtain [1, 1, 3, 5, 1, 3, 13, -9]. Summing the negative numbers present, and negating, we get a(105) = -(-9) = 9.
		

Crossrefs

Programs

  • PARI
    A318879(n) = sumdiv(n,d,d=d-(2*eulerphi(d)); (d>0)*d);

Formula

a(n) = -Sum_{d|n} [A083254(d) < 0]*A083254(d), where A083254(n) = 2*phi(n) - n, and [ ] are the Iverson brackets.
a(n) = A318878(n) - A033879(n).

A318678 Sum of deficiencies of deficient divisors of n.

Original entry on oeis.org

1, 2, 3, 3, 5, 4, 7, 4, 8, 8, 11, 5, 13, 12, 13, 5, 17, 9, 19, 9, 19, 20, 23, 6, 24, 24, 22, 13, 29, 16, 31, 6, 31, 32, 33, 10, 37, 36, 37, 10, 41, 24, 43, 25, 30, 44, 47, 7, 48, 34, 49, 31, 53, 23, 53, 14, 55, 56, 59, 17, 61, 60, 46, 7, 63, 40, 67, 43, 67, 40, 71, 11, 73, 72, 58, 49, 75, 48, 79, 11, 63, 80, 83, 25, 83, 84, 85, 26, 89, 33, 89, 61
Offset: 1

Views

Author

Antti Karttunen, Sep 04 2018

Keywords

Crossrefs

Programs

  • Mathematica
    f[n_] := 2 n - DivisorSigma[1, n]; Array[DivisorSum[#, f, f@ # >= 0 &] &, 92] (* Michael De Vlieger, Sep 04 2018 *)
  • PARI
    A318678(n) = sumdiv(n,d,d=d+d-sigma(d); (d>0)*d);

Formula

a(n) = Sum_{d|n} [A033879(d) > 0]*A033879(d).
a(n) = A296075(n) + A318679(n).

A378650 a(n) = A378647(n) - n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 2, 0, 0, 0, 16, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 28, 0, 0, 0, 12, 0, 12, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 16, 0, 8, 0, 0, 0, 66, 0, 0, 0, 0, 0, 12, 0, 0, 0, 4, 0, 104, 0, 0, 0, 0, 0, 12, 0, 40, 0, 0, 0, 72, 0, 0, 0, 4, 0, 70, 0, 0, 0, 0, 0, 128, 0, 0, 0, 20, 0, 12, 0, 2, 0
Offset: 1

Views

Author

Antti Karttunen, Dec 03 2024

Keywords

Crossrefs

Cf. A103977, A378647, A378653 (inverse Möbius transform).
Cf. A005101 (positions of nonzero terms), A263837 (of 0's).
Cf. also A318679.

Programs

Showing 1-3 of 3 results.