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 A145050 #12 Jul 16 2025 13:49:27 %S A145050 6569,8117,8689,9221,9281,9829,10289,10457,11597,11953,12577,12721, %T A145050 13093,14561,15737,15817,16529,17041,17341,17737,18089,18397,19121, %U A145050 19997,20129,20693,20789,21601,21701,22093,22433,22777,22877,23029,23633,23833,24809,25589 %N A145050 Primes p of the form 4*k+1 for which s=26 is the least positive integer such that s*p-(floor(sqrt(s*p)))^2 is a square. %C A145050 For all primes of the form 4*k+1 not exceeding 10000 the least integer s takes only values: 1, 2, 5, 10, 13, 17, 26. These values are the first numbers in A145017 (see our conjecture at A145047). %e A145050 a(1)=6569 since p=6569 is the least prime of the form 4*k+1 for which s*p-(floor(sqrt(s*p)))^2 is not a square for s=1..25, but 26*p-(floor(sqrt(26*p)))^2 is a square (for p=6569 it is 225). %Y A145050 Cf. A145016, A145017, A145022, A145023, A145043, A145047, A145048, A145049. %K A145050 nonn %O A145050 1,1 %A A145050 _Vladimir Shevelev_, Sep 30 2008, Oct 03 2008 %E A145050 More terms from _Jinyuan Wang_, Jul 16 2025