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.

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

Offset

0,1

Comments

All terms belong to A025475. See comment in A246067 for missing terms of A025475. - Jens Kruse Andersen, Aug 26 2014

Links

Jens Kruse Andersen, Table of n, a(n) for n = 0..10000

Prog

(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, ", "));

Crossrefs

Cf. A006530 (Gpf), A034699 (Lppf), A246067, A246068.

Cf. A025475.

Sequence in context: A016712 A346062 A333167 * A076359 A105675 A196054

Adjacent sequences: A246063 A246064 A246065 * A246067 A246068 A246069

Keyword

nonn

Author

Arkadiusz Wesolowski, Aug 23 2014

Status

approved