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.
%I A100387 #9 Nov 09 2022 19:08:42
%S A100387 1,2,1,2,1,2,1,1,1,2,1,4,3,2,1,2,1,2,1,1,1,2,1,1,2,1,1,2,1,2,1,1,3,2,
%T A100387 1,4,3,2,1,2,1,3,2,1,1,2,1,2,1,2,1,2,1,2,1,1,1,2,1,4,3,2,1,2,1,2,1,2,
%U A100387 1,2,1,3,2,1,2,1,1,3,2,1,1,2,1,1,3,2,1,2,1,1,1,1,3,2,1,2,1,2,1,2,1,3,2,1
%N A100387 a(n) is the largest number x such that for m=n to n+x-1, A006530(m) decreases.
%C A100387 A006530(m) is the largest prime factor of m.
%F A100387 From _Pontus von Brömssen_, Nov 09 2022: (Start)
%F A100387 a(n) = 1 if and only if n >= 2 and n is a term of A070089.
%F A100387 If a(n) > 1 then a(n) = a(n+1)+1.
%F A100387 (End)
%e A100387 a(13)=4 because the largest prime factors of 13,14,15,16 are 13,7,5,2; but A006530(17)=17.
%t A100387 <<NumberTheory`NumberTheoryFunctions` mxp[x_] :=Max[PrimeFactorList[x]]; uph=Table[First[Flatten[Position[Sign[RotateLeft[Table[mxp[n+j], {j, 0, 15}]]-Table[mxp[n+j], {j, 0, 15}]], 1]]], {n, 1, 256}]
%Y A100387 Cf. A006530, A070087, A070089, A071870, A079748, A100376, A100385, A100386.
%K A100387 nonn
%O A100387 2,2
%A A100387 _Labos Elemer_, Dec 10 2004
%E A100387 Edited by _Don Reble_, Jun 13 2007