login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000210 A Beatty sequence: floor(n*(e-1)).
(Formerly M2393 N0950)
8

%I M2393 N0950 #40 Jun 30 2017 01:49:05

%S 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 42,44,46,48,49,51,53,54,56,58,60,61,63,65,67,68,70,72,73,75,77,79,80,

%U 82,84,85,87,89,91,92,94,96,97,99,101,103,104,106,108,109,111,113,115,116

%N A Beatty sequence: floor(n*(e-1)).

%C 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 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Alois P. Heinz, <a href="/A000210/b000210.txt">Table of n, a(n) for n = 1..1000</a>

%H 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 <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>

%p a:= n-> floor (n*(exp(1)-1)): seq (a(n), n=1..200); # _Alois P. Heinz_, Aug 25 2008

%t Table[Floor[n*(E - 1)], {n, 0, 100}] (* _T. D. Noe_, Jan 21 2013 *)

%K nonn

%O 1,2

%A _N. J. A. Sloane_

%E More terms from _James A. Sellers_, Jul 06 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 13:38 EDT 2024. Contains 372212 sequences. (Running on oeis4.)