OFFSET
1,1
COMMENTS
De Koninck et al. calculated the first 50 terms of this sequence.
McDaniel and Vanden Eynden proved that a(n) exists for all n > 0. - Lingling Tong, Jun 04 2026
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..50
Charles Vanden Eynden, Differences between squares and powerful numbers, The Fibonacci Quarterly, Vol. 24, No. 4 (1986), pp. 347-348.
Jean-Marie De Koninck, Nicolas Doyon, Florian Luca, and Michoacán Morelia, Powerful values of quadratic polynomials, Journal of Integer Sequences, Vol. 14, No. 3 (2011), Article 11.3.3.
Wayne L. McDaniel, Representations of every integer as the difference of powerful numbers, The Fibonacci Quarterly, Vol. 20, No. 1 (1982), pp. 85-87.
FORMULA
a(2) = 11427 since 11427^2 - 2 = 130576327 = 7^3 * 617^2 is a nonsquare powerful number, and k^2 - 2 is not a nonsquare powerful number for all k < 11427.
PROG
(PARI) is_a102834(n) = ispowerful(n) && !issquare(n) \\ after Charles R Greathouse IV in A102834
a(n) = for(k=1, oo, if(n%k!=0 && is_a102834(k^2-n), return(k))) \\ Felix Fröhlich, Jul 19 2019
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Amiram Eldar, Jul 18 2019
STATUS
approved
