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.

A058295 Products of distinct factorials.

Original entry on oeis.org

1, 2, 6, 12, 24, 48, 120, 144, 240, 288, 720, 1440, 2880, 4320, 5040, 5760, 8640, 10080, 17280, 30240, 34560, 40320, 60480, 80640, 86400, 103680, 120960, 172800, 207360, 241920, 362880, 483840, 518400, 604800, 725760, 967680, 1036800, 1209600
Offset: 1

Views

Author

Leroy Quet, Dec 07 2000

Keywords

Comments

(A075082(n)!)^2 is a member for n>0, for example, (6!)^2=6!*5!*3!. Factorials A000142 and superfactorials A000178 (without their first terms), double-superfactorials A098694 and product-of-next-n-factorials A074319 are all subsequences. Products-of-factorials A001013 is a supersequence. - Jonathan Sondow, Dec 18 2004
A000197(n)^2 is a member for n > 2, as ((n!)!)^2 = (n!)!*n!*(n!-1)!. - Jonathan Sondow, Dec 21 2004
Erdős & Graham show that there are exp((1+o(1))n log log n / log n) members of this sequence using no factorials above n.

Examples

			288 is included because 288 = 2! * 3! * 4!.
		

Crossrefs

Programs

  • Mathematica
    k=10; m=1; With[{p=With[{s=Subsets[Table[n!, {n, 2, k}]]}, Sort[Table[Apply[Times, s[[n]]], {n, Length[s]}]]]}, While[p[[m]]<(k+1)!, m++ ]; Union[Take[p, m-1]]] (* Jonathan Sondow *)
  • PARI
    list(lim)=my(v=List([1]),n=1,t=1);while((t=n++!)<=lim,for(i=1,#v,if(v[i]*t<=lim,listput(v,v[i]*t))));vecsort(Vec(v),,8) \\ Charles R Greathouse IV, Mar 26 2012

Extensions

Corrected by Jonathan Sondow, Dec 18 2004