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 A059563 #24 Feb 16 2025 08:32:44
%S A059563 3,6,9,12,15,18,21,24,27,30,33,37,40,43,46,49,52,55,58,61,64,67,70,74,
%T A059563 77,80,83,86,89,92,95,98,101,104,108,111,114,117,120,123,126,129,132,
%U A059563 135,138,141,145,148,151,154,157,160,163,166,169,172,175,178,182,185
%N A059563 Beatty sequence for e + 1/e.
%H A059563 Harry J. Smith, <a href="/A059563/b059563.txt">Table of n, a(n) for n = 1..2000</a>
%H A059563 Aviezri S. Fraenkel, Jonathan Levitt and 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 A059563 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>.
%H A059563 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059563 a(n) = floor(n*(e+1/e)). - _Michel Marcus_, Jan 04 2015
%t A059563 Floor[Range[100]*(E + 1/E)] (* _Paolo Xausa_, Jul 06 2024 *)
%o A059563 (PARI) { default(realprecision, 100); b=exp(1) + 1/exp(1); for (n = 1, 2000, write("b059563.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%Y A059563 Beatty complement is A059564.
%Y A059563 Cf. A137204 (e+1/e).
%K A059563 nonn,easy
%O A059563 1,1
%A A059563 _Mitch Harris_, Jan 22 2001