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 of m.

This page as a plain text file.
%I A191615 #7 Apr 04 2015 21:38:08
%S A191615 1,2,3,6,7,14,16,17,34,51,54
%N 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 <m  of m.
%C A191615 Sequence is finite with 11 terms.
%C A191615 Lexicographically earliest sequence such that the first differences a(n) - a(n-1) are the largest noncomposite divisor <a(n) of a(n).
%Y A191615 Cf. A191616, A085392.
%K A191615 nonn,fini,full
%O A191615 1,2
%A A191615 _Jaroslav Krizek_, Jun 09 2011