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
1, 2, 5, 6, 12, 8, 20, 15, 23, 18, 37, 19, 47, 28, 38, 37, 66, 31, 76, 41, 61, 52, 96, 44, 96, 63, 89, 66, 129, 49, 141, 84, 109, 88, 129, 72, 176, 101, 132, 95, 198, 77, 210, 116, 142, 129, 232, 99, 226, 122, 186, 144, 269, 114, 232, 149, 214, 169, 305, 110 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Moebius transform of A006590.
LINKS
FORMULA
a(n) = Sum_{d|n} mu(n/d) * A006590(d).
MATHEMATICA
Table[Sum[Boole[GCD[n, k] == 1] Ceiling[n/k], {k, 1, n}], {n, 1, 60}]
PROG
(PARI) a(n) = sum(k=1, n, if (gcd(n, k) == 1, ceil(n/k))); \\ Michel Marcus, Feb 21 2020
CROSSREFS
Sequence in context: A110975 A190120 A069789 * A086334 A346759 A198331
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Feb 19 2020
STATUS
approved

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 23 05:37 EDT 2024. Contains 371906 sequences. (Running on oeis4.)