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.

A280298 Numbers with 67 divisors.

Original entry on oeis.org

73786976294838206464, 30903154382632612361920641803529, 13552527156068805425093160010874271392822265625, 59768263894155949306790119265585619217025149412430681649, 539407797827634189900210968137750826278309533633974732577186113975161
Offset: 1

Views

Author

Omar E. Pol, Dec 31 2016

Keywords

Comments

Also, 66th 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 = 67.

Examples

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

Crossrefs

Programs

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

Formula

a(n) = A000040(n)^(67-1) = A000040(n)^66.
A000005(a(n)) = 67.