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.

A205101 Least k!! such that n divides k!!-j!! for some j

Original entry on oeis.org

2, 3, 8, 15, 8, 8, 8, 48, 48, 48, 48, 15, 15, 15, 48, 384, 105, 105, 105, 48, 384, 46080, 48, 384, 3840, 105, 3840, 384, 645120, 105, 384, 3840, 48, 105, 945, 3840, 46080, 3840, 945, 48, 384, 384, 2027025, 46080, 48, 48, 48, 384, 10395, 10395, 105
Offset: 1

Views

Author

Clark Kimberling, Jan 22 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A204982.)