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.

A284605 The number of partitions of n! into factorials.

Original entry on oeis.org

1, 1, 2, 5, 36, 1477, 480733, 1626159677, 71503454739706, 49130011692806196131, 616983581832732519940145403
Offset: 0

Views

Author

R. J. Mathar, Mar 30 2017

Keywords

Crossrefs

Cf. A064986.

Programs

  • Maple
    A064986 := proc(n)
        local x,d,g ;
        g := 1;
        for i from 1 do
            g := g/(1-x^(i!)) ;
            g := taylor(g,x=0,n+1) ;
            if i! > n then
                break ;
            end if;
        end do:
        return coeftayl(%,x=0,n) ;
    end proc:
    for n from 0 do
        print(n,A064986(n!)) ;
    end do:
  • Mathematica
    A064986[n_] := Module[{x, d, g = 1}, For[i = 1, True, i++, g = g/(1 - x^(i!)); g = Series[g, {x, 0, n+1}]; If[i! > n, Break[]]]; Return[ SeriesCoefficient[g, {x, 0, n}]]];
    For[n = 0, n <= 7, n++, Print[n, " ", A064986[n!]]] (* Jean-François Alcover, Mar 19 2020, from Maple *)

Formula

a(n) = A064986(n!).

Extensions

a(8)-a(10) from Alois P. Heinz, Mar 30 2017