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!)
A344697 a(n) = A001615(n) / gcd(sigma(n), A001615(n)). 9
1, 1, 1, 6, 1, 1, 1, 4, 12, 1, 1, 6, 1, 1, 1, 24, 1, 12, 1, 6, 1, 1, 1, 4, 30, 1, 9, 6, 1, 1, 1, 16, 1, 1, 1, 72, 1, 1, 1, 4, 1, 1, 1, 6, 12, 1, 1, 24, 56, 30, 1, 6, 1, 9, 1, 4, 1, 1, 1, 6, 1, 1, 12, 96, 1, 1, 1, 6, 1, 1, 1, 48, 1, 1, 30, 6, 1, 1, 1, 24, 108, 1, 1, 6, 1, 1, 1, 4, 1, 12, 1, 6, 1, 1, 1, 16, 1, 56, 12, 180 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
This is not multiplicative. The first point where a(m*n) = a(m)*a(n) does not hold for coprime m and n is 108 = 4*27, where a(108) = 27, although a(4) = 6 and a(27) = 9. See A344702.
LINKS
FORMULA
a(n) = A001615(n) / A344695(n).
PROG
(PARI)
A001615(n) = if(1==n, n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
A344697(n) = { my(u=A001615(n)); (u/gcd(u, sigma(n))); };
CROSSREFS
Cf. also A344757.
Sequence in context: A331735 A345948 A346013 * A364917 A364944 A320832
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 26 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 April 26 09:24 EDT 2024. Contains 371991 sequences. (Running on oeis4.)