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 A122810 #37 Sep 19 2024 01:50:18
%S A122810 0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,3,1,3,1,3,2,2,1,4,2,2,3,3,1,3,1,4,2,2,
%T A122810 2,4,1,2,2,4,1,3,1,3,3,2,1,5,2,3,2,3,1,4,2,4,2,2,1,4,1,2,3,5,2,3,1,3,
%U A122810 2,3,1,5,1,2,3,3,2,3,1,5,4,2,1,4,2,2,2,4,1,4,2,3,2,2,2,5,1,3,3,4,1,3,1,4,3
%N A122810 Number of distinct prime factors of the smallest odd number with exactly n divisors.
%C A122810 a(n) = 1 iff n is prime.
%H A122810 Amiram Eldar, <a href="/A122810/b122810.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..2000 from Hans Havermann using the b-file of A038547 provided by _Don Reble_)
%F A122810 a(n) = omega(A038547(n)), where omega(n) = A001221(n).
%t A122810 PrimeNu[Table[Select[Range[1, 532000, 2], DivisorSigma[0, #] == k + 1 &, 1], {k, 0, 15}] // Flatten] (* _G. C. Greubel_, May 07 2017 *)
%Y A122810 Cf. A001221, A038547, A122375.
%K A122810 nonn
%O A122810 1,4
%A A122810 _Ray Chandler_, Sep 22 2006
%E A122810 Typo in A_number fixed by _Matthew Vandermast_, May 03 2014