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 A141264 #16 Jul 26 2025 19:59:13
%S A141264 1,3,5,9,9,15,13,21,25,27,21,45,25,39,45,63,33,75,37,81,65,63,45,105,
%T A141264 81,75,125,117,57,135,61,189,105,99,117,225,73,111,125,243,81,195,85,
%U A141264 189,225,135,93,315,169,243,165,225,105,375,189,351,185,171,117,405,121,183
%N A141264 Number of divisors of m^2 where m is the smallest number with exactly n divisors.
%C A141264 Variant of A103578.
%H A141264 Amiram Eldar, <a href="/A141264/b141264.txt">Table of n, a(n) for n = 1..10000</a>
%F A141264 a(n) = A000005(A005179(n)^2). - _R. J. Mathar_, Aug 31 2008
%e A141264 a(8) = 21 because the smallest number with 8 divisors is 24, 24^2 = 576 and 576 has 21 divisors.
%t A141264 a[n_]:=Module[{m=0},Until[DivisorSigma[0,m]==n,m++];DivisorSigma[0,m^2]];Array[a,25] (* _James C. McMahon_, Jul 26 2025 *)
%Y A141264 Cf. A000005, A005179, A103578.
%K A141264 nonn
%O A141264 1,2
%A A141264 _J. Lowell_, Aug 30 2008
%E A141264 Extended beyond a(8) by _R. J. Mathar_, Sep 01 2008