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 A059548 #27 Feb 16 2025 08:32:44
%S A059548 2,4,6,8,10,12,14,16,18,20,23,25,27,29,31,33,35,37,39,41,44,46,48,50,
%T A059548 52,54,56,58,60,62,65,67,69,71,73,75,77,79,81,83,86,88,90,92,94,96,98,
%U A059548 100,102,104,107,109,111,113,115,117,119,121,123,125,128,130,132,134
%N A059548 Beatty sequence for 1 + log(3).
%C A059548 Different from A064720, although the sequences agree for about 1400 terms. - _Joshua Zucker_, Apr 25 2007
%H A059548 Harry J. Smith, <a href="/A059548/b059548.txt">Table of n, a(n) for n = 1..2000</a>
%H A059548 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 A059548 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>
%H A059548 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059548 a(n) = floor(n*(1 + A002391)). - _Paolo Xausa_, Jul 05 2024
%t A059548 Floor[Range[100]*(1 + Log[3])] (* _Paolo Xausa_, Jul 05 2024 *)
%o A059548 (PARI) { default(realprecision, 100); b=1 + log(3); for (n = 1, 2000, write("b059548.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 28 2009
%Y A059548 Beatty complement is A059547.
%Y A059548 Cf. A002391.
%K A059548 nonn,easy
%O A059548 1,1
%A A059548 _Mitch Harris_, Jan 22 2001