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.

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

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