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 A003511 M0946 #41 Jul 02 2025 16:01:54 %S A003511 1,2,4,5,6,8,9,10,12,13,15,16,17,19,20,21,23,24,25,27,28,30,31,32,34, %T A003511 35,36,38,39,40,42,43,45,46,47,49,50,51,53,54,56,57,58,60,61,62,64,65, %U A003511 66,68,69,71,72,73,75,76,77,79,80,81,83,84,86,87,88,90,91,92,94,95,96 %N A003511 A Beatty sequence: floor( n * (1 + sqrt(3))/2 ). %D A003511 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A003511 Matthew House, <a href="/A003511/b003511.txt">Table of n, a(n) for n = 1..10000</a> %H A003511 Aviezri S. Fraenkel, <a href="http://dx.doi.org/10.1090/S0002-9947-1994-1138949-9">Iterated floor function, algebraic numbers, discrete chaos, Beatty subsequences, semigroups</a>, Transactions of the American Mathematical Society 341.2 (1994): 639-664. %H A003511 Aviezri S. Fraenkel, Jonathan Levitt, Michael Shimshoni, <a href="http://dx.doi.org/10.1016/0012-365X(72)90012-X">Characterization of the set of values f(n)=[n alpha], n=1,2,...</a>, Discrete Math. 2 (1972), no. 4, 335-345. %H A003511 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>. %H A003511 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a> %F A003511 a(n) = floor(n*(1+sqrt(3))/2). - _Michel Marcus_, Jan 05 2015 %p A003511 for n from 1 to 200 do printf(`%d,`,floor(n*(1 + sqrt(3))/2 )) od: %t A003511 Floor[Range[100]*(1 + Sqrt[3])/2] (* _Paolo Xausa_, Jul 05 2024 *) %Y A003511 Cf. A003512 (complement). %K A003511 nonn %O A003511 1,2 %A A003511 _N. J. A. Sloane_ %E A003511 More terms from _James Sellers_, Feb 19 2001