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 A309181 #17 Jul 18 2019 07:44:48
%S A309181 1,4,8,16,24,36,48,256,72,1024,180,144,216,16384,288,65536,360,576,
%T A309181 3072,900,864,1296,720,2304,1080,67108864,2592,268435456,1440,9216,
%U A309181 196608,5184,2160,17179869184,2880,36864,10368,3600,6300,1099511627776,4320,20736,6480
%N A309181 Least number with exactly n nonunitary divisors.
%H A309181 Amiram Eldar, <a href="/A309181/b309181.txt">Table of n, a(n) for n = 0..100</a>
%F A309181 A048105(a(n)) = n and A048105(k) != n for all k < a(n).
%F A309181 a(n) <= 2^(n+1).
%t A309181 nud[n_] := DivisorSigma[0, n] - 2^PrimeNu[n]; m = 24; c = 0; s = Table[0, {m + 1}]; k = 1; While[c < m + 1, n = nud[k]; If[n <= m && s[[n + 1]] == 0, c++; s[[n + 1]] = k]; k++]; s
%o A309181 (PARI) nnud(n) = numdiv(n) - 2^omega(n); \\ A048105
%o A309181 a(n) = my(k=1); while (nnud(k) != n, k++); k; \\ _Michel Marcus_, Jul 17 2019
%Y A309181 Cf. A005179, A048105, A309141.
%K A309181 nonn
%O A309181 0,2
%A A309181 _Amiram Eldar_, Jul 15 2019