This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A309246 #15 Jul 20 2019 12:33:08 %S A309246 3,11427,15503069909027,6,73,62531004125,85227106679780,20,15, %T A309246 71457130044805582612325294634331,56,47,16,33017,1138,68,23,19,762488, %U A309246 146,1552808,47,6234,32,45,2537,51700,54,426,83,34,40,3601,948281,531783519104,42,73,16493 %N A309246 Least number k which is not a divisor of n such that k^2 - n is a nonsquare powerful number. %C A309246 De Koninck et al. calculated the first 50 terms of this sequence. %H A309246 Amiram Eldar, <a href="/A309246/b309246.txt">Table of n, a(n) for n = 1..50</a> %H A309246 Jean-Marie De Koninck, Nicolas Doyon, Florian Luca, and Michoacán Morelia, <a href="http://emis.ams.org/journals/JIS/VOL14/DeKoninck/dek.html">Powerful values of quadratic polynomials</a>, Journal of Integer Sequences, Vol. 14, No. 3 (2011), Article 11.3.3. %F A309246 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. %o A309246 (PARI) is_a102834(n) = ispowerful(n) && !issquare(n) \\ after _Charles R Greathouse IV_ in A102834 %o A309246 a(n) = for(k=1, oo, if(n%k!=0 && is_a102834(k^2-n), return(k))) \\ _Felix Fröhlich_, Jul 19 2019 %Y A309246 Cf. A001694, A102834, A309245. %K A309246 nonn %O A309246 1,1 %A A309246 _Amiram Eldar_, Jul 18 2019