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!)
 A309525 a(n) is the greatest divisor of A006190(n) that is coprime to A006190(m) for all positive integers m < n. 1
 1, 3, 10, 11, 109, 1, 1189, 119, 1297, 131, 141481, 59, 1543321, 1429, 3089, 14159, 183642229, 433, 2003229469, 14041, 1837837, 170039, 238367471761, 7079, 23854956949, 1854841, 2186871697, 1670761, 309400794703549, 12871, 3375045015828949, 200477279 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Analog of A178763 and A308949. LINKS FORMULA a(n) = A253807(n) / gcd(A253807(n), n) if n != 6, 13. EXAMPLE A006190(12) = 467280 = 2^4 * 3^2 * 5 * 11 * 59. We have 2, 3, 5 divides A006190(6) = 360 and 11 divides A006190(3) = 11, but A006190(m) is coprime to 59 for all 1 <= m < 12, so a(12) = 59. PROG (PARI) T(n) = ([3, 1; 1, 0]^n)[2, 1] b(n) = my(v=divisors(n)); prod(i=1, #v, T(v[i])^moebius(n/v[i])) a(n) = if(isprime(n)&&!(13%n), 1543321, if(n!=6, b(n)/gcd(n, b(n)), 1)) CROSSREFS Cf. A006190, A253807. Cf. A178763, A308949, A309526. Sequence in context: A119219 A125569 A201156 * A253807 A212993 A272968 Adjacent sequences:  A309522 A309523 A309524 * A309526 A309527 A309528 KEYWORD nonn AUTHOR Jianing Song, Aug 06 2019 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 September 23 20:42 EDT 2021. Contains 347617 sequences. (Running on oeis4.)