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.

Showing 1-2 of 2 results.

A077481 Quotient A077480(n) / A077479(n).

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Nov 06 2002

Keywords

Crossrefs

A077479 Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Nov 06 2002

Keywords

Crossrefs

Programs

  • Mathematica
    PrimeNu /@ Select[ Range[2, 150], Mod[PrimeOmega[#], PrimeNu[#]] == 0 &] (* Jean-François Alcover, Jun 29 2013 *)

Formula

a(n) = A001221(A067340(n)).
Showing 1-2 of 2 results.