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]}] (* From _Harvey P. Dale, _, Oct 25 2011 *)
editing
approved
P. Erdos and C. Pomerance, On the largest prime factors of n and n+1, Aequationes Math. vol. 17, 1978, pp. 311-321.
T. D. Noe, <a href="/A082419/b082419.txt">Table of n, a(n) for n = 1..1000</a>
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>]
approved
editing
_N. J. A. Sloane (njas(AT)research.att.com), _, Apr 25 2003
editing
approved
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]}] (* From Harvey P. Dale, Oct 25 2011 *)
approved
editing
T. D. Noe, <a href="/A082419/b082419.txt">Table of n, a(n) for n=1..1000</a>
nonn,new
nonn
T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b082419.txt">Table of n, a(n) for n=1..1000</a>
nonn,new
nonn
N. J. A. Sloane (njas, (AT)research.att.com), Apr 25 2003
Numbers n such that P(n+12) < P(n-1) < P(n+1), where P(n) = largest prime factor of n (A006530).
0,1,1
T. D. Noe, <a href="http://www.research.att.com/~njas/sequences/b082419.txt">Table of n, a(n) for n=1..1000</a>
nonn,new
nonn
Numbers n such that P(n+1) < P(n-1) < P(n), where P(n) = largest prime factor of n (A006530).
nonn,new
nonn