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 A274399 #36 Nov 05 2016 08:46:25 %S A274399 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,23,24,25,26, %T A274399 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,45,46,47,48,49,50, %U A274399 51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,67,68,69,70 %N A274399 a(n) = floor(n*Pi/3). %H A274399 Paulo Romero Zanconato Pinto, <a href="/A274399/b274399.txt">Table of n, a(n) for n = 0..10000</a> %H A274399 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A274399 a(n) = floor(n*Pi/floor(Pi)) = floor(n*Pi/3). %e A274399 For n = 1000 we have that floor(1000*Pi/3) = floor(1000*1.04719755...) = floor(1047.19755...) so a(1000) = 1047. %p A274399 A274399:=n->floor(n*Pi/3): seq(A274399(n), n=0..100); # _Wesley Ivan Hurt_, Sep 26 2016 %t A274399 f[n_] := Floor[n*Pi/Floor[Pi]]; Array[f, 100, 0] %o A274399 (Maxima) makelist(floor(n*(%pi/3)), n, 0, 100); %o A274399 (PARI) a(n) = n*Pi\3; \\ _Michel Marcus_, Sep 26 2016 %Y A274399 Complement of A277051. %Y A274399 Cf. A000796, A019670. %K A274399 nonn,easy %O A274399 0,3 %A A274399 _Paulo Romero Zanconato Pinto_, Sep 26 2016