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.

A191615 a(1) = 1; a(n) is the smallest number such that a(n)-a(n-1) = A085392 (m), where A085392(m) is the largest noncomposite divisor

Original entry on oeis.org

1, 2, 3, 6, 7, 14, 16, 17, 34, 51, 54
Offset: 1

Views

Author

Jaroslav Krizek, Jun 09 2011

Keywords

Comments

Sequence is finite with 11 terms.
Lexicographically earliest sequence such that the first differences a(n) - a(n-1) are the largest noncomposite divisor

Crossrefs

Cf. A191616, A085392.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.