%I #5 Nov 15 2019 21:33:18

%S 1,2,1,4,1,6,1,8,1,2,1,12,1,2,1,16,1,6,1,4,1,2,1,24,1,2,1,4,1,6,1,32,

%T 1,2,1,36,1,2,1,8,1,6,1,4,1,2,1,48,1,2,1,4,1,6,1,8,1,2,1,12,1,2,1,64,

%U 1,6,1,4,1,2,1,24,1,2,1,4,1,6,1,16,1,2,1,12,1,2,1,8,1,6,1,4,1,2,1,96,1,2,1,4,1,6,1,8,1

%N a(n) = n/A093411(n), where A093411(n) is obtained by repeatedly dividing n by the largest factorial that divides it until an odd number is reached.

%H Antti Karttunen, <a href="/A329379/b329379.txt">Table of n, a(n) for n = 1..40319</a>

%F a(n) = n/A093411(n).

%o (PARI)

%o A076934(n) = for(k=2, oo , if(n%k, return(n), n /= k));

%o A093411(n) = if(!n,n,my(u=A076934(n)); if(n%2, return(n), return(A093411(u))));

%o A329379(n) = (n/A093411(n));

%Y Cf. A000142, A076934, A093411.

%Y Cf. also A328479.

%K nonn

%O 1,2

%A _Antti Karttunen_, Nov 15 2019