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 A083262 #14 May 20 2017 22:44:28
%S A083262 1,3,3,7,3,12,3,15,7,12,3,28,3,12,12,31,3,28,3,28,12,12,3,60,7,12,15,
%T A083262 28,3,72,3,63,12,12,12,91,3,12,12,60,3,72,3,28,28,12,3,124,7,28,12,28,
%U A083262 3,60,12,60,12,12,3,168,3,12,28,127,12,72,3,28,12,72,3,195,3,12,28,28,12,72
%N A083262 a(n) = sigma(A046523(n)), sum of divisors of the least number with the same prime signature as n.
%H A083262 Antti Karttunen, <a href="/A083262/b083262.txt">Table of n, a(n) for n = 1..10000</a>
%t A083262 Table[DivisorSigma[1, Times @@ MapIndexed[Prime[First@ #2]^#1 &, Sort[FactorInteger[n][[All, -1]], Greater]] - Boole[n == 1]], {n, 78}] (* _Michael De Vlieger_, May 20 2017 *)
%o A083262 (PARI)
%o A083262 A046523(n) = my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]) \\ This function from _Charles R Greathouse IV_, Aug 17 2011
%o A083262 A083262(n) = sigma(A046523(n)); \\ _Antti Karttunen_, May 19 2017
%Y A083262 Cf. A000203, A046523, A276528, A286360.
%K A083262 nonn
%O A083262 1,2
%A A083262 _Labos Elemer_, May 09 2003
%E A083262 Name clarified by _Antti Karttunen_, May 19 2017