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.

A209323 Values of omega(n) (A001221) as n runs through the triprimes (A014612).

Original entry on oeis.org

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

Views

Author

Wesley Ivan Hurt, Jan 19 2013

Keywords

Comments

omega(n) is the number of distinct prime divisors of n. A number is triprime if it has exactly 3 (not necessarily distinct) prime divisors.
a(n) = omega(A014612(n)).

Examples

			First triprime = 8, has 1 distinct prime divisor (2) so a(1) = 1.
		

Crossrefs

Programs

  • Mathematica
    t = {}; Do[f = FactorInteger[n]; If[Total[Transpose[f][[2]]] == 3, AppendTo[t, Length[f]]], {n, 400}]; t (* T. D. Noe, Jan 23 2013 *)