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.

A205009 Least k such that n divides the k-th difference between distinct central binomials coefficients.

Original entry on oeis.org

1, 3, 5, 3, 2, 5, 6, 9, 5, 10, 28, 21, 15, 6, 27, 9, 8, 5, 4, 27, 21, 28, 7, 21, 10, 15, 18, 21, 14, 27, 66, 9, 28, 8, 23, 40, 38, 28, 36, 33, 13, 21, 120, 28, 40, 49, 22, 21, 23, 10, 18, 44, 27, 18, 45, 21, 28, 14, 189, 27
Offset: 1

Views

Author

Clark Kimberling, Jan 22 2012

Keywords

Comments

The ordering of the differences between distinct central binomials coefficients is given by A205008. For a guide to related sequences, see A204892.

Crossrefs

Programs

  • Mathematica
    (See the program at A205010.)