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 A324966 #21 Oct 06 2023 04:55:44
%S A324966 0,1,0,1,1,1,0,1,0,2,1,1,0,1,1,1,1,1,0,2,0,2,1,1,1,1,0,1,0,2,1,1,1,2,
%T A324966 1,1,0,1,0,2,1,1,0,2,1,2,1,1,0,2,1,1,0,1,2,1,0,1,1,2,0,2,0,1,1,2,1,2,
%U A324966 1,2,0,1,1,1,1,1,1,1,0,2,0,2,1,1,2,1,0
%N A324966 Number of distinct odd prime indices of n.
%C A324966 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%C A324966 If x and y are coprime then a(x*y) = a(x)+a(y). - _Robert Israel_, Mar 24 2019
%H A324966 Robert Israel, <a href="/A324966/b324966.txt">Table of n, a(n) for n = 1..10000</a>
%F A324966 a(n) = A001221(n) - A324967(n). - _Robert Israel_, Mar 24 2019
%F A324966 G.f.: Sum_{k>=1} x^prime(2*k-1) / (1 - x^prime(2*k-1)). - _Ilya Gutkovskiy_, Feb 12 2020
%F A324966 Additive with a(p^e) = 1 if primepi(p) is odd and 0 otherwise. - _Amiram Eldar_, Oct 06 2023
%e A324966 180180 has prime indices {1,1,2,2,3,4,5,6}, so a(180180) = 3.
%p A324966 f:= proc(n) nops(select(type,map(numtheory:-pi,numtheory:-factorset(n)),odd)) end proc:
%p A324966 map(f, [$1..100]); # _Robert Israel_, Mar 24 2019
%t A324966 Table[Count[If[n==1,{},FactorInteger[n]],{_?(OddQ[PrimePi[#]]&),_}],{n,100}]
%o A324966 (PARI) a(n) = my(f=factor(n)[,1]); sum(k=1, #f, primepi(f[k]) % 2); \\ _Michel Marcus_, Mar 22 2019
%Y A324966 Cf. A000720, A001221, A003963, A005087, A066208, A112798, A257991, A257992, A289509, A324929, A324967.
%K A324966 nonn,easy
%O A324966 1,10
%A A324966 _Gus Wiseman_, Mar 21 2019