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.
%I A077480 #8 May 09 2017 00:09:40 %S A077480 1,1,2,1,2,1,3,2,2,1,1,2,2,4,1,1,2,2,1,4,2,2,3,1,3,1,5,2,2,2,4,1,2,2, %T A077480 4,1,3,1,2,1,2,2,1,4,2,4,2,2,1,1,2,6,2,3,1,2,3,1,1,2,2,3,1,4,2,1,2,2, %U A077480 2,4,1,2,2,2,2,6,1,4,1,3,1,4,3,2,1,1,3,2,1,3,2,2,2,2,2,2,3,1,7,2,3,1,2,2,4 %N A077480 Total number of prime factors of numbers m with bigomega(m) == 0 modulo omega(m) (counted with repetition). %H A077480 G. C. Greubel, <a href="/A077480/b077480.txt">Table of n, a(n) for n = 1..5000</a> %t A077480 PrimeOmega[Select[Range[2,500], Divisible[PrimeOmega[#], PrimeNu[#]] &]] (* _G. C. Greubel_, May 08 2017 *) %Y A077480 Equals A001222(A067340(n)). %Y A077480 Cf. A077479, A077481, A001221. %K A077480 nonn %O A077480 1,3 %A A077480 _Reinhard Zumkeller_, Nov 06 2002