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!)
 A330742 a(n) = n / gcd(A309639(n), A319626(n)). 4
 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 6, 1, 2, 3, 1, 1, 2, 1, 4, 7, 2, 1, 8, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 5, 4, 1, 2, 3, 5, 1, 14, 1, 4, 15, 2, 1, 6, 1, 2, 3, 4, 1, 2, 5, 7, 3, 2, 1, 12, 1, 2, 7, 1, 5, 6, 1, 4, 23, 10, 1, 8, 1, 2, 3, 4, 7, 6, 1, 5, 1, 2, 1, 28, 5, 2, 3, 8, 1, 30, 7, 4, 3, 2, 5, 6, 1, 2, 9, 4, 1, 6, 1, 8, 105 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Antti Karttunen, Table of n, a(n) for n = 1..65537 FORMULA a(n) = n / A330741(n) = n / gcd(A309639(n), A319626(n)). PROG (PARI) A330742(n) = (n/gcd(A309639(n), A319626(n))); CROSSREFS Cf. A309639, A319626, A330692, A330741, A330749. Sequence in context: A318670 A323409 A080388 * A104308 A175456 A122377 Adjacent sequences:  A330739 A330740 A330741 * A330743 A330744 A330745 KEYWORD nonn AUTHOR Antti Karttunen, Dec 29 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 June 17 04:55 EDT 2021. Contains 345080 sequences. (Running on oeis4.)