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 A048251 #19 May 14 2018 20:26:50
%S A048251 1,5,22,102,510,3210,17490,112890,600270,3466470,20205570,118879530,
%T A048251 697118730,3949737330,24217298490,143487592710,841422307110,
%U A048251 4973562896610,29520886859310,180254162529210,1052751138726210,6301225298627490,37854941354933010,224270177470178070
%N A048251 a(n) is the smallest number whose sum of divisors is 6^n.
%C A048251 Terms of this sequence are products of distinct terms in A005105. - _Ray Chandler_, Sep 01 2010
%H A048251 Ray Chandler, <a href="/A048251/b048251.txt">Table of n, a(n) for n = 0..1000</a>
%F A048251 a(n) = Min{k : A000203(k) = 6^n}.
%e A048251 sigma(k) = 1296 = 6^4 for each k in {510, 642, 710, 742, 782, 795, 862, 935, 1177, 1207, 1219}; the smallest of these is a(4)=510.
%o A048251 (PARI) a(n) = {my(k=1); while (sigma(k) != 6^n, k++); k;} \\ _Michel Marcus_, May 14 2018
%Y A048251 Cf. A006532, A020477, A019422, A019423, A018427, A048252-A048256.
%K A048251 nonn
%O A048251 0,2
%A A048251 _Labos Elemer_
%E A048251 a(9)-a(14) from _Donovan Johnson_, Sep 02 2008
%E A048251 a(15)-a(24) from _Walter Kehowski_, Aug 22 2010
%E A048251 Edited and extended by _Ray Chandler_, Sep 01 2010
%E A048251 Error in sequence corrected by _N. J. A. Sloane_, Oct 04 2010