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.

Showing 1-1 of 1 results.

A169661 Compact factorials of positive integers.

Original entry on oeis.org

1, 2, 6, 720, 5040, 3628800, 39916800
Offset: 1

Views

Author

Vladimir Shevelev, Apr 05 2010, Jun 29 2010

Keywords

Comments

A positive integer m is called a compact number if all factors of unique factorization of n over distinct terms of A050376 are relatively prime. It is convenient to suppose that 1 is compact number. Although the density of compact numbers is 0.872497..., it is easy to prove that the set of compact factorials is finite. Indeed, if n is sufficiently large, then the interval (n/4,n/3) contains a prime p and thus p^3||n! Therefore the factorization of n! over A050376 contains product p*p^2. Much more difficult to show that all compact factorials are: 1!,2!,3!,6!,7!,10!,11!. All these factorials are presented in the table.

Crossrefs

Formula

a(n) = A263881(n)!. - Jonathan Sondow, Nov 17 2015
Showing 1-1 of 1 results.