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) = n+floor(n/(2/sqrt(Pi)-1)).
2

%I #16 Oct 02 2016 04:49:37

%S 8,17,26,35,43,52,61,70,79,87,96,105,114,123,131,140,149,158,166,175,

%T 184,193,202,210,219,228,237,246,254,263,272,281,290,298,307,316,325,

%U 333,342,351,360,369,377,386,395,404,413,421,430,439,448,457,465,474

%N a(n) = n+floor(n/(2/sqrt(Pi)-1)).

%H Carauleanu Marc, <a href="/A277052/b277052.txt">Table of n, a(n) for n = 1..4242</a>

%F a(n) = n + floor(n/(2/sqrt(Pi) - 1)).

%p A277052:=n->n+floor(n/(2/sqrt(Pi)-1)): seq(A277052(n), n=1..100); # _Wesley Ivan Hurt_, Sep 26 2016

%t f[n_] := n + Floor[n/(2/Sqrt[Pi]-1)]; Array[f, 100, 1]

%o (PARI) a(n) = n + floor(n/(2/sqrt(Pi)-1));

%Y Complement of A277050.

%Y Cf. A190732, A037086.

%K nonn,easy

%O 1,1

%A _Paulo Romero Zanconato Pinto_, Sep 26 2016