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 A277052 #16 Oct 02 2016 04:49:37 %S A277052 8,17,26,35,43,52,61,70,79,87,96,105,114,123,131,140,149,158,166,175, %T A277052 184,193,202,210,219,228,237,246,254,263,272,281,290,298,307,316,325, %U A277052 333,342,351,360,369,377,386,395,404,413,421,430,439,448,457,465,474 %N A277052 a(n) = n+floor(n/(2/sqrt(Pi)-1)). %H A277052 Carauleanu Marc, <a href="/A277052/b277052.txt">Table of n, a(n) for n = 1..4242</a> %F A277052 a(n) = n + floor(n/(2/sqrt(Pi) - 1)). %p A277052 A277052:=n->n+floor(n/(2/sqrt(Pi)-1)): seq(A277052(n), n=1..100); # _Wesley Ivan Hurt_, Sep 26 2016 %t A277052 f[n_] := n + Floor[n/(2/Sqrt[Pi]-1)]; Array[f, 100, 1] %o A277052 (PARI) a(n) = n + floor(n/(2/sqrt(Pi)-1)); %Y A277052 Complement of A277050. %Y A277052 Cf. A190732, A037086. %K A277052 nonn,easy %O A277052 1,1 %A A277052 _Paulo Romero Zanconato Pinto_, Sep 26 2016