cp's OEIS Frontend

A246066 Least k such that Lppf(k) > Gpf(k) + n, where Lppf(k) is the largest prime power factor of k and Gpf(k) is the greatest prime factor of k.

%I A246066 #21 Aug 27 2014 05:18:12
%S A246066 4,4,8,8,8,8,16,16,16,16,16,16,16,16,25,25,25,25,25,25,27,27,27,27,32,
%T A246066 32,32,32,32,32,49,49,49,49,49,49,49,49,49,49,49,49,64,64,64,64,64,64,
%U A246066 64,64,64,64,64,64,64,64,64,64,64,64,64,64,81,81,81,81,81
%N A246066 Least k such that Lppf(k) > Gpf(k) + n, where Lppf(k) is the largest prime power factor of k and Gpf(k) is the greatest prime factor of k.
%C A246066 All terms belong to A025475. See comment in A246067 for missing terms of A025475. - _Jens Kruse Andersen_, Aug 26 2014
%H A246066 Jens Kruse Andersen, <a href="/A246066/b246066.txt">Table of n, a(n) for n = 0..10000</a>
%o A246066 (PARI) k=2; for(n=0, 66, k=k-1; until(vecmax(vector(#f[, 1], i, f[i, 1]^f[i, 2]))>vecmax(f[, 1])+n, k++; f=factor(k)); print1(k, ", "));
%Y A246066 Cf. A006530 (Gpf), A034699 (Lppf), A246067, A246068.
%Y A246066 Cf. A025475.
%K A246066 nonn
%O A246066 0,1
%A A246066 _Arkadiusz Wesolowski_, Aug 23 2014