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.

A280299 Numbers with 71 divisors.

Original entry on oeis.org

1180591620717411303424, 2503155504993241601315571986085849, 8470329472543003390683225006796419620513916015625, 143503601609868434285603076356671071740077383739246066639249, 7897469567994392174328988784504809847540729881935024059662581894710332201
Offset: 1

Views

Author

Omar E. Pol, Dec 31 2016

Keywords

Comments

Also, 70th powers of primes.
More generally, the n-th number with p divisors is equal to the n-th prime raised to power p-1, where p is prime. In this case, p = 71.

Examples

			a(1) = 2^70, a(2) = 3^70, a(3) = 5^70, a(4) = 7^70, a(5) = 11^70.
		

Crossrefs

Programs

  • Mathematica
    Array[Prime[#]^70 &, {5}] (* Michael De Vlieger, Dec 31 2016 *)
  • PARI
    a(n)=prime(n)^70

Formula

a(n) = A000040(n)^(71-1) = A000040(n)^70.
A000005(a(n)) = 71.