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!)
A075988 Number of integers k satisfying 1 <= k <= n and 0 < frac(n/k) < 1/2, where frac(n/k) is the fractional part of n/k; i.e., frac(n/k) = n/k - floor(n,k). 2

%I #14 Sep 08 2022 08:45:07

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

%T 13,19,16,16,18,16,17,24,20,18,20,23,21,25,23,23,25,25,23,30,26,28,30,

%U 28,26,30,30,34,34,32,28,37,35,31,36,37,37,41,35,37,37,41,38,46,42,40

%N Number of integers k satisfying 1 <= k <= n and 0 < frac(n/k) < 1/2, where frac(n/k) is the fractional part of n/k; i.e., frac(n/k) = n/k - floor(n,k).

%F Sum_{k=1..n} (ceiling(n/k) - round(n/k)). - _Vladeta Jovovic_, Mar 01 2004

%o (Magma) [&+[(Ceiling(n/k)-Round(n/k)): k in [1..n]]: n in [1..80]]; // _Vincenzo Librandi_, Jul 30 2017

%o (PARI) a(n) = sum(k=1, n, f = frac(n/k); f && (f < 1/2)); \\ _Michel Marcus_, Jul 30 2017

%Y Cf. A075989, A076990.

%K nonn

%O 1,7

%A _Clark Kimberling_, Sep 28 2002

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 March 29 00:26 EDT 2024. Contains 371264 sequences. (Running on oeis4.)