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 A277051 #23 Nov 05 2016 08:46:42 %S A277051 22,44,66,88,110,133,155,177,199,221,244,266,288,310,332,355,377,399, %T A277051 421,443,465,488,510,532,554,576,599,621,643,665,687,710,732,754,776, %U A277051 798,820,843,865,887,909,931,954,976,998,1020,1042,1065,1087,1109,1131,1153,1175 %N A277051 a(n) = floor(n/(1-3/Pi)). %H A277051 Charles R Greathouse IV, <a href="/A277051/b277051.txt">Table of n, a(n) for n = 1..10000</a> %H A277051 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A277051 a(n) = floor(n/(1-3/Pi)). %e A277051 For n = 10 we have that floor(10/(1-3/Pi)) = floor(10/0.04719755...) = floor(211.8754045...) so a(10) = 221. %p A277051 A277051:=n->floor(n/(1-3/Pi)): seq(A277051(n), n=1..100); # _Wesley Ivan Hurt_, Sep 26 2016 %t A277051 f[n_] := Floor[n/(1-3/Pi)]; Array[f, 100, 1] %o A277051 (Maxima) makelist(floor(n / (1-3 / %pi )), n, 1, 100); %o A277051 (PARI) a(n)=n\(1-3/Pi) \\ _Charles R Greathouse IV_, Sep 26 2016 %Y A277051 Complement of A274399. %Y A277051 Cf. A000796, A019670. %K A277051 nonn,easy %O A277051 1,1 %A A277051 _Paulo Romero Zanconato Pinto_, Sep 26 2016