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!)
A345305 a(n) = n * Sum_{p|n, p prime} gcd(p,n/p) / p. 0
0, 1, 1, 4, 1, 5, 1, 8, 9, 7, 1, 16, 1, 9, 8, 16, 1, 27, 1, 24, 10, 13, 1, 32, 25, 15, 27, 32, 1, 31, 1, 32, 14, 19, 12, 72, 1, 21, 16, 48, 1, 41, 1, 48, 54, 25, 1, 64, 49, 75, 20, 56, 1, 81, 16, 64, 22, 31, 1, 92, 1, 33, 72, 64, 18, 61, 1, 72, 26, 59, 1, 144, 1, 39, 100, 80, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
If p is prime, a(p) = p * Sum_{p|p} gcd(p,p/p) / p = p * (1/p) = 1.
LINKS
EXAMPLE
a(18) = 18 * Sum_{p|18} gcd(p,18/p) / p = 18 * (gcd(2,9)/2 + gcd(3,6)/3) = 18 * (1/2 + 1) = 27.
MATHEMATICA
Table[n*Sum[(1/k) GCD[k, n/k] (PrimePi[k] - PrimePi[k - 1]) (1 - Ceiling[n/k] + Floor[n/k]), {k, n}], {n, 100}]
CROSSREFS
Cf. A345266.
Sequence in context: A157104 A101322 A029644 * A024919 A328385 A328099
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, Jun 13 2021
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 May 10 05:09 EDT 2024. Contains 372356 sequences. (Running on oeis4.)