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!)
 A329602 Square root of largest square dividing A108951(n), where A108951 is fully multiplicative with a(prime(i)) = prime(i)# = Product_{i=1..i} A000040(i). 4
 1, 1, 1, 2, 1, 2, 1, 2, 6, 2, 1, 2, 1, 2, 6, 4, 1, 6, 1, 2, 6, 2, 1, 4, 30, 2, 6, 2, 1, 6, 1, 4, 6, 2, 30, 12, 1, 2, 6, 4, 1, 6, 1, 2, 6, 2, 1, 4, 210, 30, 6, 2, 1, 12, 30, 4, 6, 2, 1, 12, 1, 2, 6, 8, 30, 6, 1, 2, 6, 30, 1, 12, 1, 2, 30, 2, 210, 6, 1, 4, 36, 2, 1, 12, 30, 2, 6, 4, 1, 12, 210, 2, 6, 2, 30, 8, 1, 210, 6, 60, 1, 6, 1, 4, 30 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10201 FORMULA a(n) = A000188(A108951(n)). PROG (PARI) A000188(n) = core(n, 1)[2]; \\ From A000188 A034386(n) = prod(i=1, primepi(n), prime(i)); A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951 A329602(n) = A000188(A108951(n)); CROSSREFS Cf. A000188, A108951. Sequence in context: A210700 A215745 A059913 * A083273 A193163 A106157 Adjacent sequences:  A329599 A329600 A329601 * A329603 A329604 A329605 KEYWORD nonn AUTHOR Antti Karttunen, Nov 19 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 April 18 05:44 EDT 2021. Contains 343072 sequences. (Running on oeis4.)