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.

A204937 (k(n)!-j(n)!)/n, where (k!,j!) is the least pair of distinct factorials for which n divides k!-j!.

Original entry on oeis.org

1, 2, 6, 1, 1, 3, 17, 12, 2, 60, 2, 8, 27912, 51, 40, 6, 7, 1, 6, 30, 34, 1, 1, 4, 24, 13956, 160, 1260, 24, 20, 117058, 3, 152, 21, 1008, 120, 168297840, 3, 9304, 15, 120, 17, 927360, 114, 96, 876, 77208, 2, 720, 12, 14, 6978, 9037766, 80, 720, 630, 2
Offset: 1

Views

Author

Clark Kimberling, Jan 21 2012

Keywords

Comments

The ordering of differences k!-j! is given at A204930. For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A204932.)