The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A340366 a(n) = A324106(n) / gcd(A005940(n), A324106(n)), where A324106(n) is multiplicative with a(p^e) = A005940(p^e). 4
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 45, 1, 15, 1, 1, 1, 25, 1, 1, 27, 1, 1, 1, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 1, 9, 1, 1, 5, 1, 1, 7, 1, 125, 45, 1, 1, 27, 15, 1, 1, 1, 1, 49, 1, 27, 25, 1, 1, 1, 1, 1, 27, 1, 1, 25, 1, 1, 1, 3, 1, 243, 1, 7, 1, 1, 1, 35, 1, 1, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,15 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA a(n) = A324106(n) / A340364(n) = A324106(n) / gcd(A005940(n), A324106(n)). PROG (PARI) A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; A324106(n) = { my(f=factor(n)); prod(i=1, #f~, A005940(f[i, 1]^f[i, 2])); }; A340366(n) = { my(u=A324106(n)); (u / gcd(u, A005940(n))); }; CROSSREFS Cf. A005940, A324106, A340364, A340365. Sequence in context: A046602 A282304 A250662 * A031261 A188796 A161685 Adjacent sequences:  A340363 A340364 A340365 * A340367 A340368 A340369 KEYWORD nonn AUTHOR Antti Karttunen, Jan 06 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 14 05:51 EDT 2021. Contains 345018 sequences. (Running on oeis4.)