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.

A066922 a(n) = gcd(Omega(n), omega(n)).

Original entry on oeis.org

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

Views

Author

Benoit Cloitre, Jan 23 2002

Keywords

Crossrefs

Cf. A001221 (omega), A001222 (Omega), A066921, A113901.

Programs

  • Mathematica
    Table[GCD[PrimeOmega[n],PrimeNu[n]],{n,110}] (* Harvey P. Dale, Dec 05 2015 *)
  • PARI
    a(n) = { gcd(bigomega(n),omega(n)) } \\ Harry J. Smith, Apr 07 2010

Formula

a(n) = A113901(n)/A066921(n). - Amiram Eldar, May 07 2025