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.

A192929 Least highly abundant number with n distinct prime factors.

Original entry on oeis.org

1, 2, 6, 30, 210, 4620, 120120, 4084080, 116396280, 2677114440, 310545275040, 14440355289360, 1068586291412640, 114873026326858800, 9419588158802421600, 442720643463713815200, 54011918502573085454400, 8587895041909120587249600
Offset: 0

Views

Author

Enrique Pérez Herrero, Jul 12 2011

Keywords

Comments

a(n) is the least number in sequence A002093, with A001221(a(n)) = n.

References

  • S. S. Pillai, Highly abundant numbers, Bull. Calcutta Math. Soc., 35, (1943), 141-156.

Crossrefs