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.

A359965 a(n) is the least arithmetic number (A003601) having exactly n divisors.

Original entry on oeis.org

1, 3, 49, 6, 14641, 20, 594823321, 30, 8281, 304, 41426511213649, 60, 491258904256726154641, 832, 717409, 168, 160470643909878751793805444097921, 612, 114445997944945591651333831028437092270721, 432, 87616, 44032, 6111571184724799803076702357055363809, 420, 13521270961
Offset: 1

Views

Author

Amiram Eldar, Jan 20 2023

Keywords

Comments

a(n) is the least number k such that A000005(k) = n and n | A000203(k).
a(n) exists for all n: for example, if p is a prime such that p == 1 (mod n), then p^(n-1) has n divisors and n | A000203(p^(n-1)).

Crossrefs

Subsequence of A003601.
Similar sequences: A005179, A073904.