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.

A325509 Number of factorizations of n! into factorial numbers > 1.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0

Views

Author

Gus Wiseman, May 08 2019

Keywords

Examples

			n = 10:
  (6*120*5040)
  (720*5040)
  (3628800)
n = 16:
  (2*2*2*2*1307674368000)
  (2*120*87178291200)
  (20922789888000)
n = 24:
  (2*2*6*25852016738884976640000)
  (24*25852016738884976640000)
  (620448401733239439360000)
		

Crossrefs

Programs

  • Mathematica
    facs[n_,u_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d,u],Min@@#>=d&]],{d,Intersection[u,Rest[Divisors[n]]]}]];
    Table[Length[facs[n!,Rest[Array[#!&,n]]]],{n,15}]

Formula

a(n) = 1 + A034876(n).

Extensions

More terms from Alois P. Heinz, May 08 2019