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.

A336387 Number of prime divisors of n that do not divide sigma(n); a(1) = 0.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 25 2020

Keywords

Crossrefs

Cf. A175200 (positions of zeros).
Cf. also A173438, A336352, A336388.

Programs

  • Mathematica
    Table[Length[Select[FactorInteger[n][[All,1]],Mod[DivisorSigma[ 1,n],#]!= 0&]],{n,110}] (* Harvey P. Dale, Jan 15 2022 *)
  • PARI
    A336387(n) = if(1==n,0,my(s=sigma(n)); #select(p -> (s%p), factor(n)[, 1]));

Formula

a(n) = Sum_{p over distinct primes dividing n} [sigma(n) != 0 mod p].