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.

Showing 1-1 of 1 results.

A191616 a(1) = 1; a(n) is the largest number m such that m-A085392(m) = a(n-1).

Original entry on oeis.org

1, 2, 4, 5, 10, 15, 20, 25, 30, 32
Offset: 1

Views

Author

Jaroslav Krizek, Jun 09 2011

Keywords

Comments

Lexicographically largest sequence such that a(n) - a(n-1) is the largest noncomposite divisor
Sequence is finite with 10 terms.
(The reason is that m-A085392(m) = 0, 1, 2, 2, 4, 3, 6, 6, 6, 5, 10, 9, 12, 7,.. starts to grow with a lower bound of m/2, and a(10)=32 is not in its list of values.)

Crossrefs

Cf. A085392, A191615.
Showing 1-1 of 1 results.

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

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