A329379 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.

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

Offset: 1

Author

Antti Karttunen, Nov 15 2019

Keywords

• nonn

Links

• Antti Karttunen, Table of n, a(n) for n = 1..40319

Crossrefs

Cf. A000142, A076934, A093411.

Cf. also A328479.

Programs

PARI

A076934(n) = for(k=2, oo , if(n%k, return(n), n /= k));
A093411(n) = if(!n,n,my(u=A076934(n)); if(n%2, return(n), return(A093411(u))));
A329379(n) = (n/A093411(n));

Formula

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