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.

A061234 Smallest number with prime(n)^2 divisors where prime(n) is the n-th prime.

Original entry on oeis.org

6, 36, 1296, 46656, 60466176, 2176782336, 2821109907456, 101559956668416, 131621703842267136, 6140942214464815497216, 221073919720733357899776, 10314424798490535546171949056, 13367494538843734067838845976576
Offset: 1

Views

Author

Labos Elemer, Jun 01 2001

Keywords

Examples

			1296 = 2*2*2*2*3*3*3*3 is the smallest number with 25 divisors.
		

Crossrefs

Formula

a(n) = Min_{x : d(x) = A000005(x) = p(n)^2} = 6^(p(n)-1) because x = 2^(pp-1) > 2^(p-1)3^(p-1) holds if p > 1.
a(n) = A005179(A001248(n)). - Amiram Eldar, Jun 21 2024