login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070999
Numbers n such that the denominator of Sum_{k=1..n} 1/gcd(n,k) is not equal to n.
2
6, 15, 18, 21, 30, 33, 35, 42, 44, 45, 48, 51, 54, 60, 66, 69, 70, 78, 84, 87, 90, 99, 102, 105, 114, 119, 120, 123, 126, 132, 133, 135, 138, 140, 141, 144, 147, 150, 153, 159, 162, 165, 168, 174, 177, 180, 186, 195, 198, 204, 207, 210, 213, 217, 220, 221, 222
OFFSET
1,1
COMMENTS
Does lim_{n->infinity} a(n)/n = 3?
Sum_{k=1..n} 1/gcd(n,k) = (1/n)*Sum_{d|n} phi(d)*d = (1/n)*Sum_{k=1..n} gcd(n,k)*phi(gcd(n,k))/phi(n/gcd(n,k)), where phi = A000010. - Richard L. Ollerton, May 10 2021
Numbers k such that gcd(k, A057660(k)) > 1. - Amiram Eldar, Jun 29 2022
LINKS
EXAMPLE
Sum_{k=1..6} 1/gcd(6,k) = 7/2, hence 6 is in the sequence;
Sum_{k=1..12} 1/gcd(12,k) = 77/12 so 12 is not in the sequence.
MATHEMATICA
Select[Range[300], Denominator[Sum[1/GCD[#, k], {k, #}]]!=#&] (* Harvey P. Dale, May 07 2022 *)
f[p_, e_] := (p^(2*e + 1) + 1)/(p + 1); s[n_] := Times @@ (f @@@ FactorInteger[n]); Select[Range[250], !CoprimeQ[#, s[#]] &] (* Amiram Eldar, Jun 29 2022 *)
PROG
(PARI) for(n=1, 300, if(denominator(sum(i=1, n, 1/gcd(n, i)))<n, print1(n, ", ")))
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 18 2002
STATUS
approved