[go: up one dir, main page]
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!)
A373377 a(n) = gcd(A059975(n), A083345(n)), where A059975 is fully additive with a(p) = p-1, and A083345 is the numerator of the fully additive function with a(p) = 1/p. 4
0, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 6, 2, 1, 1, 1, 2, 1, 1, 8, 1, 1, 1, 5, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 12, 1, 1, 1, 1, 2, 9, 2, 14, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 18, 2, 1, 1, 1, 1, 1, 1, 20, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 24, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
COMMENTS
For each n >= 2, a(n) is a divisor of A373378(n).
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..65537
PROG
(PARI)
A059975(n) = { my(f = factor(n)); sum(i = 1, #f~, f[i, 2]*(f[i, 1] - 1)); };
A083345(n) = { my(f=factor(n)); numerator(vecsum(vector(#f~, i, f[i, 2]/f[i, 1]))); };
A373377(n) = gcd(A059975(n), A083345(n));
CROSSREFS
Cf. A059975, A083345.
Cf. A369002 (positions of even terms), A369003 (of odd terms).
Cf. also A373363, A373368, A373369, A373378.
Sequence in context: A197027 A143772 A373366 * A053989 A342459 A057160
Adjacent sequences: A373374 A373375 A373376 * A373378 A373379 A373380
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 05 2024
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 August 28 15:05 EDT 2024. Contains 375507 sequences. (Running on oeis4.)