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!)
A194813 Number of integers k in [1,n] such that {n*r + k*r} < {n*r - k*r}, where { } = fractional part and r = (1+sqrt(5))/2 (the golden ratio). 7

%I #15 Jun 25 2022 10:00:24

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

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

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

%N Number of integers k in [1,n] such that {n*r + k*r} < {n*r - k*r}, where { } = fractional part and r = (1+sqrt(5))/2 (the golden ratio).

%C A194813 + A194814 = A000027 for n > 0.

%e {4r+1r} = 0.09...; {4r-1r} = 0.85...;

%e {4r+2r} = 0.70...; {4r-2r} = 0.23...;

%e {4r+3r} = 0.32...; {4r-3r} = 0.61...;

%e {4r+4r} = 0.94...; {4r-4r} = 0.00...;

%e so that a(4)=2.

%t r = GoldenRatio; 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}] (* A194813 *)

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

%Y Cf. A001622, A194814, A194738.

%Y Partial sums of A327174.

%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 April 25 06:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)