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.

A341524 Number of prime factors in A017666(n), counted with multiplicity: a(n) = bigomega(n) - bigomega(gcd(n, sigma(n))).

Original entry on oeis.org

0, 1, 1, 2, 1, 0, 1, 3, 2, 1, 1, 1, 1, 1, 1, 4, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 3, 0, 1, 1, 1, 5, 1, 1, 2, 4, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 3, 2, 3, 1, 2, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 3, 6, 2, 1, 1, 2, 1, 2, 1, 4, 1, 1, 3, 1, 2, 1, 1, 4, 4, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 3, 2, 4, 1, 1, 1, 3, 2, 1, 1, 3, 1, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 0
Offset: 1

Views

Author

Antti Karttunen, Feb 17 2021

Keywords

Crossrefs

Cf. A007691 (positions of zeros).
Cf. A341608 (applied onto prime shift array A246278).

Programs

  • Mathematica
    Table[PrimeOmega[n] - PrimeOmega[GCD[n, DivisorSigma[1, n]]], {n, 1, 100}] (* Amiram Eldar, Feb 17 2021 *)
  • PARI
    A341524(n) = (bigomega(n) - bigomega(gcd(n, sigma(n))));

Formula

a(n) = A001222(A017666(n)).
a(n) = A001222(n) - A341523(n).