login

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”).

a(n) = nearest integer to Pi*prime(n).
0

%I #36 Mar 29 2018 21:48:59

%S 6,9,16,22,35,41,53,60,72,91,97,116,129,135,148,167,185,192,210,223,

%T 229,248,261,280,305,317,324,336,342,355,399,412,430,437,468,474,493,

%U 512,525,543,562,569,600,606,619,625,663,701,713,719,732,751,757,789,807

%N a(n) = nearest integer to Pi*prime(n).

%e a(13) = nearest integer to Pi*prime(13) = the nearest integer to (Pi*41) = 128.805298... = 129, so a(13) = 129.

%t Table[Round[Pi Prime@ n], {n, 55}] (* _Michael De Vlieger_, Feb 20 2017 *)

%o (PARI) a(n) = round(Pi*prime(n)); \\ _Michel Marcus_, Feb 20 2017

%Y Cf. A000796.

%Y Subsequence of A022853.

%K nonn

%O 1,1

%A _Ahmad J. Masad_, Feb 20 2017