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!)
 A328569 Exponent of least prime factor in A276086(A276086(n)), where A276086 converts the primorial base expansion of n into its prime product form. 4
 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 2, 1, 4, 1, 5, 1, 1, 1, 6, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 5, 1, 4, 1, 2, 1, 3, 1, 9, 1, 1, 1, 4, 1, 1, 1, 1, 1, 4, 1, 2, 1, 2, 1, 7, 1, 10, 1, 1, 1, 2, 1, 6, 1, 2, 1, 10, 1, 8, 1, 1, 1, 6, 1, 7, 1, 1, 1, 3, 1, 4, 1, 2, 1, 5, 1, 4, 1, 1, 1, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS Equally, the least significant nonzero digit in primorial base expansion of A276086(n). LINKS Antti Karttunen, Table of n, a(n) for n = 0..32768 FORMULA a(n) = A276088(A276086(n)) = A067029(A276087(n)). max(a(n),1+A051903(A328400(A003557(A276086(A328476(n)))))) = A328389(n). [A328400 is optional in the formula] For all even n, a(n) < A328579(n). PROG (PARI) A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; A276088(n) = { my(e=0, p=2); while(n && !(e=(n%p)), n = n/p; p = nextprime(1+p)); (e); }; A328569(n) = A276088(A276086(n)); CROSSREFS Cf. A003557, A051903, A067029, A276086, A276087, A276088, A328389, A328400, A328476, A328570, A328579. Sequence in context: A176784 A176511 A243977 * A016569 A072801 A098872 Adjacent sequences:  A328566 A328567 A328568 * A328570 A328571 A328572 KEYWORD nonn AUTHOR Antti Karttunen, Oct 20 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.

Last modified April 6 14:08 EDT 2020. Contains 333276 sequences. (Running on oeis4.)