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.

A334655 Number of integers less than n with the same number of distinct prime factors as n.

Original entry on oeis.org

0, 0, 1, 2, 3, 0, 4, 5, 6, 1, 7, 2, 8, 3, 4, 9, 10, 5, 11, 6, 7, 8, 12, 9, 13, 10, 14, 11, 15, 0, 16, 17, 12, 13, 14, 15, 18, 16, 17, 18, 19, 1, 20, 19, 20, 21, 21, 22, 22, 23, 24, 25, 23, 26, 27, 28, 29, 30, 24, 2, 25, 31, 32, 26, 33, 3, 27, 34, 35, 4, 28, 36, 29, 37, 38, 39, 40, 5, 30, 41
Offset: 1

Views

Author

Ilya Gutkovskiy, Oct 31 2020

Keywords

Examples

			a(12) = 2 because omega(12) = 2 and also omega(6) = omega(10) = 2.
		

Crossrefs

Cf. A001221, A002110 (positions of 0's), A047983, A067003, A067004, A322837, A322841, A335097.

Programs

  • Maple
    R:= NULL:
    for n from 1 to 100 do
      w:= nops(numtheory:-factorset(n));
      if assigned(V[w]) then V[w]:= V[w]+1 else V[w]:= 1 fi;
      R:= R, V[w]-1
    od:
    R; # Robert Israel, Feb 25 2024
  • Mathematica
    Table[Length[Select[Range[n - 1], PrimeNu[#] == PrimeNu[n] &]], {n, 80}]
  • PARI
    a(n)={my(t=omega(n)); sum(k=1, n-1, omega(k)==t)} \\ Andrew Howroyd, Oct 31 2020

Formula

a(n) = |{j < n : omega(j) = omega(n)}|.
a(n) = A067003(n) - 1.