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 A000572 M2621 N1037 #25 Jul 02 2025 16:01:53
%S A000572 3,7,11,14,18,22,26,29,33,37,40,44,48,52,55,59,63,66,70,74,78,81,85,
%T A000572 89,92,96,100,104,107,111,115,118,122,126,130,133,137,141,145,148,152,
%U A000572 156,159,163,167,171,174,178,182,185,189,193,197,200,204,208,211,215,219
%N A000572 A Beatty sequence: [ n(e+1) ].
%D A000572 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000572 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000572 T. D. Noe, <a href="/A000572/b000572.txt">Table of n, a(n) for n = 1..1000</a>
%H A000572 I. G. Connell, <a href="http://dx.doi.org/10.4153/CMB-1960-004-2">Some properties of Beatty sequences II</a>, Canad. Math. Bull., 3 (1960), 17-22.
%H A000572 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%p A000572 for n from 1 to 200 do printf(`%d,`,floor( n*(exp(1)+1))) od:
%t A000572 Table[Floor[n*(E + 1)], {n, 100}] (* _T. D. Noe_, Jun 20 2012 *)
%Y A000572 Cf. A006594.
%K A000572 nonn
%O A000572 1,1
%A A000572 _N. J. A. Sloane_
%E A000572 More terms from _James Sellers_, Feb 19 2001