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.

A079748 Largest k such that the greatest prime factors from n to n+k are monotonically increasing.

Original entry on oeis.org

2, 1, 0, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 3, 2, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 2, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 2, 1, 0, 2, 1, 0, 0, 1, 0, 4, 3, 2, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 10 2003

Keywords

Comments

A006530(n+i) < A006530(n+j) for 0 <= i < j < a(n);
if a(n) > 0 then a(n+1) = a(n) - 1.

Examples

			n=20: 20 = 5*2^2, 21 = 7*3, 22 = 11*2 and 23, followed by 24 = 3*2^3: therefore a(20)=3 (5 < 7 < 11 < 23 and 23 > 3).
		

Crossrefs

Formula

a(n) = 0 if and only if n is a term of A070087. - Pontus von Brömssen, Nov 09 2022