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 A000210 M2393 N0950 #41 Jul 02 2025 16:01:53
%S A000210 1,3,5,6,8,10,12,13,15,17,18,20,22,24,25,27,29,30,32,34,36,37,39,41,
%T A000210 42,44,46,48,49,51,53,54,56,58,60,61,63,65,67,68,70,72,73,75,77,79,80,
%U A000210 82,84,85,87,89,91,92,94,96,97,99,101,103,104,106,108,109,111,113,115,116
%N A000210 A Beatty sequence: floor(n*(e-1)).
%C A000210 The first 38 terms coincide with the corresponding terms of A082977, i.e., numbers that are congruent to {0, 1, 3, 5, 6, 8, 10} mod 12. - _Giovanni Resta_, Mar 24 2006
%D A000210 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000210 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000210 Alois P. Heinz, <a href="/A000210/b000210.txt">Table of n, a(n) for n = 1..1000</a>
%H A000210 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 A000210 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%p A000210 a:= n-> floor (n*(exp(1)-1)): seq (a(n), n=1..200); # _Alois P. Heinz_, Aug 25 2008
%t A000210 Table[Floor[n*(E - 1)], {n, 0, 100}] (* _T. D. Noe_, Jan 21 2013 *)
%K A000210 nonn
%O A000210 1,2
%A A000210 _N. J. A. Sloane_
%E A000210 More terms from _James Sellers_, Jul 06 2000