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”).
%I #7 Mar 30 2012 19:00:25
%S 1,2,4,5,10,15,20,25,30,32
%N a(1) = 1; a(n) is the largest number m such that m-A085392(m) = a(n-1).
%C Lexicographically largest sequence such that a(n) - a(n-1) is the largest noncomposite divisor <a(n) of a(n).
%C Sequence is finite with 10 terms.
%C (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.)
%Y Cf. A085392, A191615.
%K nonn,fini,full
%O 1,2
%A _Jaroslav Krizek_, Jun 09 2011