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.

A336352 Number of prime divisors of sigma(n) that are larger than the largest prime factor of n; a(1) = 0.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jul 19 2020

Keywords

Crossrefs

Cf. A000203, A006530, A058062, A336353 (positions of zeros).

Programs

  • PARI
    A336352(n) = if(1==n,0,my(gp=vecmax(factor(n)[, 1])); #select(p -> (p>gp), factor(sigma(n))[, 1]));

Formula

For all n >= 1, a(n) <= A058062(n).