Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Apr 11 2021 04:07:24
%S 2,5,5,7,2,5,11,13,17,11,7,19,7,11,17,17,11,19,5,7,11,7,37,19,41,41,
%T 17,11,23,19,7,17,13,37,11,19,59,61,41,7,43,11,17,71,71,29,37,19,11,
%U 79,23,41,43,17,29,11,61,61,31,97,97,13,11,101,103,13,53,107,31,11,113,19,23
%N a(n) is that prime number p less than n*Pi such that n*Pi/p has the largest fractional part.
%e a(14)=11 because 14*Pi/11 = 3.998... and the fractional part 0.998... represents the greatest remainder resulting from the division of 14*Pi by a prime number less than 14*Pi.
%t f[n_] := Denominator[ Max[ FractionalPart[(n*Pi / Prime@ Range@ PrimePi@ Floor[n*Pi - 1])]] [[2]]]; Array[f, 73] (* _Robert G. Wilson v_, Apr 08 2007 *)
%Y Cf. A129227.
%K easy,nonn
%O 1,1
%A _Axel Harvey_, Apr 04 2007
%E Edited and extended by _Robert G. Wilson v_, Apr 08 2007