login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A191616
a(1) = 1; a(n) is the largest number m such that m-A085392(m) = a(n-1).
1
1, 2, 4, 5, 10, 15, 20, 25, 30, 32
OFFSET
1,2
COMMENTS
Lexicographically largest sequence such that a(n) - a(n-1) is the largest noncomposite divisor <a(n) of a(n).
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
Sequence in context: A097133 A023165 A058299 * A319909 A276281 A059994
KEYWORD
nonn,fini,full
AUTHOR
Jaroslav Krizek, Jun 09 2011
STATUS
approved