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.

A121934 Smallest positive number m such that m == i (mod i+1) for all 1<=i<=n.

Original entry on oeis.org

1, 1, 5, 11, 59, 59, 419, 839, 2519, 2519, 27719, 27719, 360359, 360359, 360359, 720719, 12252239, 12252239, 232792559, 232792559, 232792559, 232792559, 5354228879, 5354228879, 26771144399, 26771144399, 80313433199, 80313433199
Offset: 1

Views

Author

Zak Seidov, Sep 03 2006

Keywords

Crossrefs

Except for the first term, a duplicate of A070198.

Formula

For n>=2, a(n) = A003418(n+1)-1.

Extensions

Edited by N. J. A. Sloane, Nov 18 2007, at the suggestion of Max Alekseyev.