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!)
A056548 a(n) = Sum_{k>=1} round(n/k) where round(1/2) = 0. 1

%I #14 May 03 2019 17:33:56

%S 0,1,4,7,11,15,19,23,29,32,37,43,47,52,58,62,68,73,79,84,90,94,100,

%T 108,112,117,124,128,136,142,146,152,160,165,171,177,183,188,196,202,

%U 208,215,219,227,233,237,247,253,259,263,272,277,283,293,297,303,311,315

%N a(n) = Sum_{k>=1} round(n/k) where round(1/2) = 0.

%F a(n) = A056549(n) - A001227(n).

%F Conjecture: a(n) = Sum_{k=n..2n-1} d(k), where d is the number of divisors function (A000005). - _Ridouane Oudra_, Apr 29 2019

%Y Cf. A000005, A001227, A006218, A056549.

%K easy,nonn

%O 0,3

%A _Henry Bottomley_, Jun 21 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 April 27 21:23 EDT 2024. Contains 372020 sequences. (Running on oeis4.)