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!)
A332683 a(n) = Sum_{k=1..n, gcd(n, k) = 1} ceiling(n/k). 0

%I #7 Feb 21 2020 10:02:52

%S 1,2,5,6,12,8,20,15,23,18,37,19,47,28,38,37,66,31,76,41,61,52,96,44,

%T 96,63,89,66,129,49,141,84,109,88,129,72,176,101,132,95,198,77,210,

%U 116,142,129,232,99,226,122,186,144,269,114,232,149,214,169,305,110

%N a(n) = Sum_{k=1..n, gcd(n, k) = 1} ceiling(n/k).

%C Moebius transform of A006590.

%F a(n) = Sum_{d|n} mu(n/d) * A006590(d).

%t Table[Sum[Boole[GCD[n, k] == 1] Ceiling[n/k], {k, 1, n}], {n, 1, 60}]

%o (PARI) a(n) = sum(k=1, n, if (gcd(n, k) == 1, ceil(n/k))); \\ _Michel Marcus_, Feb 21 2020

%Y Cf. A006590, A008683, A116477, A332682.

%K nonn

%O 1,2

%A _Ilya Gutkovskiy_, Feb 19 2020

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 July 27 14:45 EDT 2024. Contains 374647 sequences. (Running on oeis4.)