login
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.
3

%I #21 Aug 27 2014 05:18:12

%S 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 32,32,32,32,32,49,49,49,49,49,49,49,49,49,49,49,49,64,64,64,64,64,64,

%U 64,64,64,64,64,64,64,64,64,64,64,64,64,64,81,81,81,81,81

%N 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 All terms belong to A025475. See comment in A246067 for missing terms of A025475. - _Jens Kruse Andersen_, Aug 26 2014

%H Jens Kruse Andersen, <a href="/A246066/b246066.txt">Table of n, a(n) for n = 0..10000</a>

%o (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 Cf. A006530 (Gpf), A034699 (Lppf), A246067, A246068.

%Y Cf. A025475.

%K nonn

%O 0,1

%A _Arkadiusz Wesolowski_, Aug 23 2014