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 A277112 #12 Nov 05 2016 08:47:01 %S A277112 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25, %T A277112 26,27,28,29,30,31,32,33,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49, %U A277112 50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,69,70 %N A277112 a(n) = floor(n*(1+sqrt(5))/Pi). %H A277112 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A277112 a(n) = floor(n*(1+sqrt(5))/Pi). %e A277112 For n = 1000 we have that floor(1000*(1+sqrt(5))/Pi) = floor(1000*1.0300724296...) = floor(1030.0724296...) so a(1000) = 1030. %p A277112 A277112:=n->floor(n*(1+sqrt(5))/Pi): seq(A277112(n), n=0..100); # _Wesley Ivan Hurt_, Oct 31 2016 %t A277112 f[n_] := Floor[n*(1+Sqrt[5])/Pi]; Array[f, 100, 0] %Y A277112 Complement of A277113. %Y A277112 Cf. A000796, A001622, A094881, A094882. %K A277112 nonn,easy %O A277112 0,3 %A A277112 _Paulo Romero Zanconato Pinto_, Sep 30 2016