%I A145050
%S A145050 6569,8117,8689,9221,9281,9829
%N A145050 Primes p of the form 4k+1 for which s=26 is the least positive integer 
               such that sp-(floor(sqrt(sp)))^2 is a full square
%C A145050 For all primes of the form 4k+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 in A145047)
%e A145050 a(1)=6569 since p=6569 is the least prime of the form 4k+1 for which 
               sp-(floor(sqrt(sp)))^2 is not a full square for s=1,...,25, but 26p-(floor(sqrt(26p)))^2 
               is a full square (for p=6569 it is 225)
%Y A145050 A145016 A145017 A145022 A145023 A145043 A145047 A145048 A145049
%Y A145050 Sequence in context: A031669 A031579 A031759 this_sequence A164971 A048268 
               A043634
%Y A145050 Adjacent sequences: A145047 A145048 A145049 this_sequence A145051 A145052 
               A145053
%K A145050 nonn
%O A145050 1,1
%A A145050 Vladimir Shevelev (shevelev(AT)bgu.ac.il), Sep 30 2008, Oct 03 2008