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.

A293899 Number of proper divisors of the form 3k+1 minus number of proper divisors of the form 3k+2.

Original entry on oeis.org

0, 1, 1, 0, 1, 0, 1, 1, 1, -1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 2, -1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, -1, 1, 1, 1, 1, 2, -1, 1, 0, 1, 1, 0, -1, 1, 1, 2, 1, 0, 1, 1, 0, -1, 1, 2, -1, 1, 0, 1, 1, 2, 0, 1, 0, 1, 1, 0, -1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, -1, 1, 2, -1, 1, 0, -1, 1, 0, 3, 1, 2, -1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2017

Keywords

Crossrefs

Programs

  • Mathematica
    Table[DivisorSum[n, 1 &, And[Mod[#, 3] == 1, # != n] &] - DivisorSum[n, 1 &, And[Mod[#, 3] == 2, # != n] &], {n, 105}] (* Michael De Vlieger, Nov 08 2017 *)
    Table[Total[Which[Mod[#,3]==1,1,Mod[#,3]==2,-1,True,0]&/@Most[ Divisors[ n]]],{n,110}] (* Harvey P. Dale, Nov 26 2021 *)
  • PARI
    A293895(n) = sumdiv(n,d,(dA293896(n) = sumdiv(n,d,(dA293899(n) = (A293895(n) - A293896(n));

Formula

When n = 3k, a(n) = A002324(n), when n = 3k+1, a(n) = A002324(n) - 1, when n = 3k+2, a(n) = A002324(n) + 1.
a(n) = A002324(n) - A010872(n) (mod 3).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi/(3*sqrt(3)) = 0.604599... (A073010). - Amiram Eldar, Nov 25 2023