login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

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

PROG

(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));

CROSSREFS

Cf. A000142, A076934, A093411.

Cf. also A328479.

Sequence in context: A322036 A318441 A161510 * A328479 A340346 A193267

Adjacent sequences:  A329376 A329377 A329378 * A329380 A329381 A329382

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 15 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 14:40 EDT 2021. Contains 347618 sequences. (Running on oeis4.)