The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A340192 a(n) = Sum_{d|n} A063994(d), where A063994(x) = Product_{primes p dividing x} gcd(p-1, x-1). 4
 1, 2, 3, 3, 5, 5, 7, 4, 5, 7, 11, 7, 13, 9, 11, 5, 17, 8, 19, 9, 13, 13, 23, 9, 9, 15, 7, 13, 29, 15, 31, 6, 17, 19, 15, 11, 37, 21, 19, 11, 41, 17, 43, 15, 21, 25, 47, 11, 13, 12, 23, 19, 53, 11, 19, 15, 25, 31, 59, 19, 61, 33, 19, 7, 33, 25, 67, 21, 29, 21, 71, 14, 73, 39, 19, 25, 21, 23, 79, 13, 9, 43, 83, 23, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..8191 Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537 FORMULA a(n) = Sum_{d|n} A063994(d). a(n) = n - A340193(n). PROG (PARI) A063994(n) = { my(f=factor(n)); prod(i=1, #f~, gcd(f[i, 1]-1, n-1)); }; A340192(n) = sumdiv(n, d, A063994(d)); CROSSREFS Inverse Möbius transform of A063994. Cf. A340190, A340193. Sequence in context: A146071 A167411 A340195 * A112823 A247176 A325163 Adjacent sequences: A340189 A340190 A340191 * A340193 A340194 A340195 KEYWORD nonn AUTHOR Antti Karttunen, Dec 31 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.

Last modified December 7 15:01 EST 2022. Contains 358667 sequences. (Running on oeis4.)