OFFSET
1,1
COMMENTS
De Koninck et al. calculated the first 50 terms of this sequence.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..50
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.
EXAMPLE
a(1) = 682 since 682^2 + 1 = 465125 = 5^3 * 61^2 is a nonsquare powerful number and is the smallest k > 0 such that k^2 + 1 is not a nonsquare powerful number.
MATHEMATICA
powerfulQ[n_] := Min@FactorInteger[n][[All, 2]] > 1; powerfulNonsquare[n_] := !IntegerQ[Sqrt[n]] && powerfulQ[n]; a[n_] := Module[{k=1}, While[Divisible[n, k] || !powerfulNonsquare[k^2 + n], k++]; k]; Table[a[n], {n, 1, 16}]
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
AUTHOR
Amiram Eldar, Jul 18 2019
STATUS
approved