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 A059541 #27 Feb 16 2025 08:32:43
%S A059541 1,3,5,6,8,10,11,13,15,16,18,20,22,23,25,27,28,30,32,33,35,37,38,40,
%T A059541 42,44,45,47,49,50,52,54,55,57,59,60,62,64,66,67,69,71,72,74,76,77,79,
%U A059541 81,82,84,86,88,89,91,93,94,96,98,99,101,103,104,106,108,110,111,113
%N A059541 Beatty sequence for 1 + log(2).
%H A059541 Harry J. Smith, <a href="/A059541/b059541.txt">Table of n, a(n) for n = 1..2000</a>
%H A059541 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 A059541 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence.</a>
%H A059541 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059541 a(n) = floor(n*(1+log(2))).
%t A059541 Floor[Range[100]*(1 + Log[2])] (* _Paolo Xausa_, Jul 05 2024 *)
%o A059541 (PARI) { default(realprecision, 100); b=1 + log(2); for (n = 1, 2000, write("b059541.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%Y A059541 Beatty complement is A059542.
%Y A059541 Cf. A002162.
%K A059541 nonn,easy
%O A059541 1,2
%A A059541 _Mitch Harris_, Jan 22 2001