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 A260146 #26 Jun 03 2018 02:04:55
%S A260146 1,1,3,12,44,264,1020,8160,19680,55104,182784,2193408,4608000,
%T A260146 64512000,210524160,560849520,964157040,17354826720,32092508448,
%U A260146 641850168960,1302952210560,3134374548480,9806680558080,235360333393920,374108929689600,740882390169600
%N A260146 Number of positive divisors of hyperfactorial(n).
%H A260146 Matthew Campbell and Charles R Greathouse IV, <a href="/A260146/b260146.txt">Table of n, a(n) for n = 0..1866</a> (terms 0..677 from Campbell)
%F A260146 a(n) = A000005(A002109(n)).
%e A260146 a(2) = sigma(0, hyperfactorial(2)) = sigma(0, 2^2*1^1) = sigma(0, 4). The divisors of 4 are 1, 2, and 4. The number of divisors is a(2) = 3.
%t A260146 Table[DivisorSigma[0, Hyperfactorial[n]], {n, 0, 200}]
%o A260146 (PARI) hf(n,p)=my(s); forstep(k=p,n,p, s+=k); if(n<p^2, s, p*hf(n\p,p)+s)
%o A260146 a(n)=factorback(apply(p->hf(n,p)+1, primes([2,n]))) \\ _Charles R Greathouse IV_, Jul 17 2015
%Y A260146 Cf. A000005, A002109.
%K A260146 nonn,easy
%O A260146 0,3
%A A260146 _Matthew Campbell_, Jul 17 2015