login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049792 a(n) = Sum_{k=1..n} floor(n/floor(n/k)). 7
1, 3, 7, 11, 18, 24, 34, 43, 55, 66, 82, 94, 113, 129, 150, 167, 192, 211, 239, 261, 290, 315, 349, 374, 410, 440, 478, 509, 552, 583, 629, 665, 711, 750, 802, 838, 893, 937, 992, 1036, 1097, 1141, 1205, 1255, 1317, 1370, 1440 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = A049790(n, n).

a(n) = A222548(n) - Sum_{i=1..n} floor(n/i)*floor(n/(i+1)). - Ridouane Oudra, Jun 22 2020

MAPLE

seq( add(floor(n/floor(n/j)), j=1..n), n=1..60); # G. C. Greubel, Dec 10 2019

MATHEMATICA

Table[Total[Table[Quotient[n, Quotient[n, k]], {k, n}]], {n, 47}] (* Ivan Neretin, Jul 29 2015 *)

PROG

(PARI) a(n) = sum(j=1, n, n\(n\j));

vector(60, n, a(n) ) \\ G. C. Greubel, Dec 10 2019

(MAGMA) [(&+[Floor(n/Floor(n/j)): j in [1..n]]): n in [1..60]]; // G. C. Greubel, Dec 10 2019

(Sage) [sum(floor(n/floor(n/j)) for j in (1..n)) for n in (1..60)] # G. C. Greubel, Dec 10 2019

(GAP) List([1..60], n-> Sum([1..n], j-> Int(n/Int(n/j)) )); # G. C. Greubel, Dec 10 2019

CROSSREFS

Cf. A049790, A049791, A049793, A049794, A049795, A049796.

Sequence in context: A063437 A190711 A210977 * A062851 A178464 A071979

Adjacent sequences:  A049789 A049790 A049791 * A049793 A049794 A049795

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 7 06:57 EDT 2021. Contains 343636 sequences. (Running on oeis4.)