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.

A347883 a(n) = A342926(n) mod 3.

Original entry on oeis.org

2, 2, 1, 0, 0, 1, 2, 0, 1, 2, 2, 2, 2, 0, 2, 0, 1, 1, 2, 0, 2, 2, 0, 2, 0, 0, 2, 1, 2, 0, 1, 1, 1, 2, 2, 2, 2, 0, 2, 2, 0, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 1, 1, 1, 2, 2, 2, 2, 0, 2, 2, 0, 2, 0, 2, 0, 2, 1, 2, 2, 1, 2, 2, 0, 2, 1, 0, 2, 1, 0, 1, 2, 2, 1, 2, 0, 1, 2, 1, 0, 2, 0, 1, 2, 2, 0, 1, 1, 1, 1, 2, 0, 1, 2, 1
Offset: 1

Views

Author

Antti Karttunen, Sep 18 2021

Keywords

Crossrefs

Cf. A000203, A003415, A342926, A347880 (positions of zeros).
Cf. also A347871.

Programs

  • Mathematica
    ad[1] = 0; ad[n_] := n * Total@(Last[#]/First[#]& /@ FactorInteger[n]); a[n_] := Mod[ad[DivisorSigma[1, n]] - n, 3]; Array[a, 105] (* Amiram Eldar, Sep 18 2021 *)
  • PARI
    A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
    A342926(n) = (A003415(sigma(n))-n);
    A347883(n) = (A342926(n)%3);

Formula

a(n) = A342926(n) mod 3.