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 A323305 #6 Jan 13 2019 08:50:08 %S A323305 1,1,1,2,1,2,1,2,2,2,1,2,1,2,2,3,1,2,1,2,2,2,1,3,2,2,2,2,1,2,1,2,2,2, %T A323305 2,3,1,2,2,3,1,2,1,2,2,2,1,2,2,2,2,2,1,3,2,3,2,2,1,3,1,2,2,4,2,2,1,2, %U A323305 2,2,1,2,1,2,2,2,2,2,1,2,3,2,1,3,2,2,2 %N A323305 Number of divisors of the number of prime factors of n counted with multiplicity. %C A323305 a(1) = 1 by convention. %C A323305 First differs from A036430 at a(64) = 4, A036430(64) = 3. %F A323305 a(n) = A000005(A001222(n)). %t A323305 Array[Length@*Divisors@*PrimeOmega,100] %o A323305 (PARI) a(n) = if (n==1, 1, numdiv(bigomega(n))); \\ _Michel Marcus_, Jan 13 2019 %Y A323305 Positions of 1's are 1 and the prime numbers A008578. %Y A323305 Positions of 2's are A063989. %Y A323305 Cf. A000005, A001222, A067028, A167175, A323295, A323350. %K A323305 nonn %O A323305 1,4 %A A323305 _Gus Wiseman_, Jan 13 2019