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 A323384 #6 Jan 20 2019 09:48:28 %S A323384 1,2,3,7,9,6,27,14,12,18,243,21,729,54,36,56,6561,60,19683,63,108,486, %T A323384 177147,42,144,1458,147,189,4782969,180,14348907,182,972,13122,432,84, %U A323384 387420489,39366,2916,126,3486784401,540,10460353203,1701,441,354294,94143178827,168,1728,720 %N A323384 Smallest number with exactly n divisors in Eisenstein integers. %C A323384 a(n) is the smallest k such that A319442(k) = n. %C A323384 Analog of A005179 and A302252 over the ring of Eisenstein integers. The divisors are counted up to association. %F A323384 For primes p > 2, a(p) = 3^((p-1)/2). %e A323384 Let w = (1 + sqrt(3)*i)/2, w' = (1 - sqrt(3)*i)/2. %e A323384 The divisors of 14 in Eisenstein integers are 1, 2, 2 + w, 2 + w', 7, 4 + 2*w, 4 + 2*w', 14 and there associations, and 14 is the smallest number having exactly 8 divisors in Eisenstein integers, so a(8) = 14. %e A323384 The divisors of 21 in Eisenstein integers are 1, 2*w - 1, 3, 2 + w, 2 + w', 5 - w, 5 - w', 6 + 3*w, 6 + 3*w', 7, 14*w - 7, 21 and there associations, and 21 is the smallest number having exactly 12 divisors in Eisenstein integers, so a(12) = 21. %o A323384 (PARI) %o A323384 a(n) = if(isprime(n)&&n>2, 3^((n-1)/2), my(k=1); while(A319442(k)!=n, k++); k) %Y A323384 Cf. A005179, A302252, A319442 (number of divisors of n in Eisenstein integers). %K A323384 nonn %O A323384 1,2 %A A323384 _Jianing Song_, Jan 12 2019