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.

A053497 Number of degree-n permutations of order dividing 7.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 721, 5761, 25921, 86401, 237601, 570241, 1235521, 892045441, 13348249201, 106757164801, 604924594561, 2722120577281, 10344007402561, 34479959558401, 24928970490633601, 546446134633639681, 6281586217487489041, 50248618811434961281
Offset: 0

Views

Author

N. J. A. Sloane, Jan 15 2000

Keywords

References

  • R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Example 5.2.10.

Crossrefs

Sequences with e.g.f. exp(x + x^m/m): A000079 (m=1), A000085 (m=2), A001470 (m=3), A118934 (m=4), A052501 (m=5), A293588 (m=6), this sequence (m=7).
Column k=7 of A008307.

Programs

  • Magma
    R:=PowerSeriesRing(Rationals(), 31); Coefficients(R!(Laplace( Exp(x + x^7/7) ))); // G. C. Greubel, May 14 2019, Mar 07 2021
    
  • Maple
    a:= proc(n) option remember; `if`(n<0, 0, `if`(n=0, 1,
           add(mul(n-i, i=1..j-1)*a(n-j), j=[1, 7])))
        end:
    seq(a(n), n=0..25); # Alois P. Heinz, Feb 14 2013
  • Mathematica
    CoefficientList[Series[Exp[x+x^7/7], {x, 0, 24}], x]*Range[0, 24]! (* Jean-François Alcover, Mar 24 2014 *)
  • PARI
    my(x='x+O('x^30)); Vec(serlaplace( exp(x+x^7/7) )) \\ G. C. Greubel, May 14 2019
    
  • Sage
    f=factorial; [sum(f(n)/(7^j*f(j)*f(n-7*j)) for j in (0..n/7)) for n in (0..30)] # G. C. Greubel, May 14 2019

Formula

E.g.f.: exp(x + x^7/7).
a(n) = Sum_{k=0..floor(n/7)} n!/(7^k*k!*(n-7*k)!). - G. C. Greubel, Mar 07 2021