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!)
 A334039 For any n > 0: start with x = n; for k = 1..n, if k divides x then divide x by k; a(n) corresponds to the final value of x. 1
 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 1, 5, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 2, 7, 5, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 5, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Every integer appears infinitely many times in this sequence. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 FORMULA a(s) = 1 for any squarefree number s. a(p^2) = p for any prime number p. a(p^k) = p^A002262(k) for any k >= 0 and prime number p. a(n!) = 1 for any n >= 0. a(n! * k) = k for any n >= 1 and k = 1..n. PROG (PARI) a(n) = { fordiv (n, d, if (n%d==0, n\=d); if (n<=d, return (n))) } CROSSREFS Cf. A002262. Sequence in context: A134505 A329376 A336643 * A076933 A071974 A056622 Adjacent sequences:  A334036 A334037 A334038 * A334040 A334041 A334042 KEYWORD nonn AUTHOR Rémy Sigrist, Apr 13 2020 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 September 16 23:53 EDT 2021. Contains 347477 sequences. (Running on oeis4.)