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 A302252 #23 Jul 29 2024 06:15:39
%S A302252 1,3,2,5,4,6,8,15,16,12,32,10,64,24,36,65,256,48,512,20,72,96,2048,30,
%T A302252 324,192,50,40,16384,252,32768,195,288,768,648,80,262144,1536,576,60,
%U A302252 1048576,504,2097152,160,100,6144,8388608,130,5832,1875,2304,320
%N A302252 Smallest number with exactly n divisors in Gaussian integers.
%C A302252 The divisors are counted up to association.
%H A302252 Amiram Eldar, <a href="/A302252/b302252.txt">Table of n, a(n) for n = 1..1000</a>
%H A302252 <a href="/index/Ga#gaussians">Index entries for Gaussian integers and primes</a>.
%F A302252 For prime p > 2, a(p) = 2^((p-1)/2) = sqrt(A005179(p)).
%t A302252 a[n_] := If[n > 2 && PrimeQ[n], 2^((n-1)/2), Block[{k=1}, While[ DivisorSigma[0, k, GaussianIntegers -> True] != n, k++]; k]]; Array[a, 52] (* _Giovanni Resta_, Apr 04 2018 *)
%o A302252 (PARI) nbd(n) = {my(r=1, f=factor(n)); for(j=1, #f[, 1], my(p=f[j, 1], e=f[j, 2]); if(p==2, r*=(2*e+1)); if(p%4==1, r*=(e+1)^2); if(p%4==3, r*=(e+1));); return(r);} \\ A062327
%o A302252 a(n) = {my(k=1); while (nbd(k) != n, k++); k;} \\ _Michel Marcus_, Apr 26 2018
%Y A302252 Cf. A005179, A062327.
%K A302252 nonn
%O A302252 1,2
%A A302252 _Jianing Song_, Apr 04 2018
%E A302252 More terms from _Giovanni Resta_, Apr 04 2018