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 A340233 #13 Jan 02 2021 04:50:16
%S A340233 1,4,16,36,65536,144,18446744073709551616,576,1296,589824
%N A340233 a(n) is the least number with exactly n exponential divisors.
%C A340233 a(11) = 2^(2^10) has 309 digits and is too large to be included in the data section.
%C A340233 See the link for more values of this sequence.
%H A340233 Amiram Eldar, <a href="/A340233/b340233.txt">Table of n, a(n) for n = 1..12</a>
%H A340233 Amiram Eldar, <a href="/A340233/a340233.txt">Table of n, a(n) for n = 1..100</a> (given by prime factorizations)
%F A340233 A049419(a(n)) = n and A049419(k) != n for all k < a(n).
%e A340233 a(2) = 4 since 4 is the least number with 2 exponential divisors, 2 and 4.
%t A340233 f[p_, e_] := DivisorSigma[0, e]; d[1] = 1; d[n_] := Times @@ (f @@@ FactorInteger[n]); max = 6; s = Table[0, {max}]; c = 0; n = 1; While[c < max, i = d[n]; If[i <= max && s[[i]] == 0, c++; s[[i]] = n]; n++]; s (* ineffective for n > 6 *)
%Y A340233 Subsequence of A025487.
%Y A340233 Cf. A049419, A318278, A322791.
%Y A340233 Similar sequences: A005179 (all divisors), A038547 (odd divisors), A085629 (coreful divisors), A309181 (nonunitary), A340232 (bi-unitary).
%K A340233 nonn
%O A340233 1,2
%A A340233 _Amiram Eldar_, Jan 01 2021