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 A059533 #27 Feb 16 2025 08:32:43
%S A059533 1,3,5,7,9,11,13,15,17,19,21,22,24,26,28,30,32,34,36,38,40,42,44,45,
%T A059533 47,49,51,53,55,57,59,61,63,65,67,68,70,72,74,76,78,80,82,84,86,88,90,
%U A059533 91,93,95,97,99,101,103,105,107,109,111,113,114,116,118,120,122,124
%N A059533 Beatty sequence for 1 + Catalan's constant.
%H A059533 Harry J. Smith, <a href="/A059533/b059533.txt">Table of n, a(n) for n = 1..2000</a>
%H A059533 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 A059533 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BeattySequence.html">Beatty Sequence</a>
%H A059533 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%F A059533 a(n) = floor(n*(1+A006752)). - _R. J. Mathar_, May 22 2019
%t A059533 Floor[Range[100]*(1 + Catalan)] (* _Paolo Xausa_, Jul 05 2024 *)
%o A059533 (PARI) { numdigits=100; default(realprecision, numdigits+80); s=1.0; n=5*numdigits; j=4*n+1; si=-1.0; for (i=3, j-2, s+=si/i^2; si=-si; i++; ); s+=0.5/j^2; ttk=4.0; d=4.0*j^3; xk=2.0; xkp=xk; for (k=2, 100000000, term=(ttk-1)*ttk*xkp; xk++; xkp*=xk; if (k>2, term*=xk; xk++; xkp*=xk; ); term*=bernreal(k)/d; sn=s+term; if (sn==s, break); s=sn; ttk*=4.0; d*=(k+1)*(k+2)*j^2; k++; ); b=1 + s; for (n = 1, 2000, write("b059533.txt", n, " ", floor(n*b)); ) } \\ _Harry J. Smith_, Jun 27 2009
%Y A059533 Beatty complement is A059534.
%K A059533 nonn,easy
%O A059533 1,2
%A A059533 _Mitch Harris_, Jan 22 2001