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!)
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

%I #7 Nov 20 2019 09:34:53

%S 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,

%T 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,

%U 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

%N 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).

%H Antti Karttunen, <a href="/A329602/b329602.txt">Table of n, a(n) for n = 1..10201</a>

%F a(n) = A000188(A108951(n)).

%o (PARI)

%o A000188(n) = core(n, 1)[2]; \\ From A000188

%o A034386(n) = prod(i=1, primepi(n), prime(i));

%o A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951

%o A329602(n) = A000188(A108951(n));

%Y Cf. A000188, A108951.

%K nonn

%O 1,4

%A _Antti Karttunen_, Nov 19 2019

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 July 15 18:49 EDT 2024. Contains 374333 sequences. (Running on oeis4.)