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 A082419 #11 Nov 21 2013 12:48:00
%S A082419 6,10,22,25,28,30,33,46,52,58,68,70,78,82,88,93,98,102,106,110,115,
%T A082419 126,130,133,138,141,145,148,160,166,172,178,187,190,198,201,205,208,
%U A082419 213,222,226,232,236,238,248,253,262,268,273,286,292,304,306,310,316,328,346,348
%N A082419 Numbers n such that P(n+2) < P(n) < P(n+1), where P(n) = largest prime factor of n (A006530).
%D A082419 Antal Balog, On the largest prime factor of consecutive integers, Abstracts Amer. Math. Soc., 25 (No. 2, 2002), p. 337, #975-11-76.
%H A082419 T. D. Noe, <a href="/A082419/b082419.txt">Table of n, a(n) for n = 1..1000</a>
%H A082419 P. Erdős and C. Pomerance, <a href="http://www.math.dartmouth.edu/~carlp/PDF/paper17.pdf">On the largest prime factors of n and n+1</a>, Aequationes Math. 17 (1978), p. 311-321. [<a href="http://www.renyi.hu/~p_erdos/1978-29.pdf">alternate link</a>]
%t A082419 pflist=Select[Partition[Table[{n,lpf[n]},{n,400}],3,1],#[[3,-1]]< #[[1,-1]]< #[[2,-1]]&]; Table[pflist[[n,1,1]],{n,Length[pflist]}] (* _Harvey P. Dale_, Oct 25 2011 *)
%Y A082419 Cf. A006530, A082417-A082422, A071869, A071870.
%K A082419 nonn
%O A082419 1,1
%A A082419 _N. J. A. Sloane_, Apr 25 2003