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.

A073049 Least m > 1 such that m^n has m divisors, or 0 if no such m exists.

Original entry on oeis.org

2, 3, 28, 5, 0, 7, 225, 153, 640, 11, 6348, 13, 19474560, 0, 976, 17, 1225, 19, 1521, 81, 0, 23, 343000, 49, 2601, 2133, 3025, 29, 1495296000, 31, 20063232, 4225, 15262600, 4761, 19236456, 37, 25462407801600, 5929, 34633600, 41, 0, 43, 7569, 356445, 8281
Offset: 1

Views

Author

Lekraj Beedassy, Aug 31 2002

Keywords

Comments

Since a prime power p^k has exactly k+1 divisors, choosing k=p-1, where p is a prime, thus implies a(p-1)=p for any prime p.

Crossrefs

Extensions

Definition and terms for n = 1, 13, 23, 29, 31, 33, 35, 37, 39, and 44 corrected by Jon E. Schoenfield, Apr 17 2010