%I #19 Jan 06 2019 04:54:02
%S 2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,
%T 3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,3,3,2,3,3,3,2,
%U 3,3,2,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2
%N First differences of the Beatty sequence A022843 for e.
%H Clark Kimberling, <a href="/A276859/b276859.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = floor(n*r) - floor(n*r - r), where r = e, n >= 1.
%p A276859:=n->floor(n*exp(1))-floor((n-1)*exp(1)): seq(A276859(n), n=1..200); # _Wesley Ivan Hurt_, Jan 10 2017
%t z = 500; r = E; b = Table[Floor[k*r], {k, 0, z}] (* A022843 *)
%t Differences[b] (* A276859 *)
%t Differences[Floor[E*Range[0,90]]] (* _Harvey P. Dale_, Nov 24 2016 *)
%Y Cf. A022843, A276875.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Sep 24 2016