cp's OEIS Frontend

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.

A260146 Number of positive divisors of hyperfactorial(n).

Original entry on oeis.org

1, 1, 3, 12, 44, 264, 1020, 8160, 19680, 55104, 182784, 2193408, 4608000, 64512000, 210524160, 560849520, 964157040, 17354826720, 32092508448, 641850168960, 1302952210560, 3134374548480, 9806680558080, 235360333393920, 374108929689600, 740882390169600
Offset: 0

Views

Author

Matthew Campbell, Jul 17 2015

Keywords

Examples

			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.
		

Crossrefs

Programs

  • Mathematica
    Table[DivisorSigma[0, Hyperfactorial[n]], {n, 0, 200}]
  • PARI
    hf(n,p)=my(s); forstep(k=p,n,p, s+=k); if(nhf(n,p)+1, primes([2,n]))) \\ Charles R Greathouse IV, Jul 17 2015

Formula

a(n) = A000005(A002109(n)).