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!)
A194819 Number of integers k in [1,n] such that {n*e+k*e} < {n*e-k*e}, where { } = fractional part. 2

%I

%S 0,1,1,2,3,3,3,3,4,4,5,6,6,6,6,7,7,8,9,10,10,10,11,11,12,13,14,14,14,

%T 15,15,16,17,18,18,18,19,19,19,19,20,20,21,22,22,22,22,23,23,24,25,25,

%U 25,25,26,26,27,28,29,29,29,30,30,31,32,33,33,33,34,34,35,36,37

%N Number of integers k in [1,n] such that {n*e+k*e} < {n*e-k*e}, where { } = fractional part.

%t r = E; p[x_] := FractionalPart[x];

%t u[n_, k_] := If[p[n*r + k*r] <= p[n*r - k*r], 1, 0]

%t v[n_, k_] := If[p[n*r + k*r] > p[n*r - k*r], 1, 0]

%t s[n_] := Sum[u[n, k], {k, 1, n}]

%t t[n_] := Sum[v[n, k], {k, 1, n}]

%t Table[s[n], {n, 1, 100}] (* A194819 *)

%t Table[t[n], {n, 1, 100}] (* A194820 *)

%Y Cf. A001113, A194820.

%Y Partial sums of A327183.

%K nonn

%O 1,4

%A _Clark Kimberling_, Sep 03 2011

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 September 28 06:00 EDT 2022. Contains 357063 sequences. (Running on oeis4.)