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.

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

This page as a plain text file.
%I A077479 #11 May 09 2017 00:09:34
%S A077479 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,
%T A077479 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,
%U A077479 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
%N A077479 Number of distinct prime factors of numbers m with BigOmega(m) == 0 modulo omega(m).
%H A077479 G. C. Greubel, <a href="/A077479/b077479.txt">Table of n, a(n) for n = 1..1000</a>
%F A077479 a(n) = A001221(A067340(n)).
%t A077479 PrimeNu /@ Select[ Range[2, 150], Mod[PrimeOmega[#], PrimeNu[#]] == 0 &] (* _Jean-François Alcover_, Jun 29 2013 *)
%Y A077479 Cf. A001221, A067340, A077480, A077481, A001222.
%K A077479 nonn
%O A077479 1,5
%A A077479 _Reinhard Zumkeller_, Nov 06 2002