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!)
 A329030 The least missing nonzero digit in the primorial base expansion of A276086(n). 2
 2, 2, 2, 2, 2, 1, 3, 3, 3, 2, 3, 1, 2, 2, 3, 1, 3, 3, 3, 3, 3, 1, 3, 1, 3, 2, 3, 2, 3, 1, 2, 3, 2, 3, 3, 2, 3, 3, 4, 2, 4, 1, 2, 2, 4, 1, 4, 2, 3, 3, 4, 1, 5, 1, 2, 2, 4, 1, 5, 3, 2, 2, 2, 3, 4, 3, 3, 3, 4, 1, 4, 2, 2, 2, 4, 1, 5, 1, 3, 4, 4, 3, 4, 1, 3, 6, 4, 2, 4, 2, 3, 2, 2, 1, 2, 1, 3, 3, 4, 1, 4, 2, 2, 2, 4, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Antti Karttunen, Table of n, a(n) for n = 0..32768 FORMULA a(n) = A329028(A276086(n)) = A134193(A276087(n)) . PROG (PARI) A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); }; A329028(n) = { my(m=Map(), p=2); while(n, mapput(m, (n%p), 1); n = n\p; p = nextprime(1+p)); for(k=1, oo, if(!mapisdefined(m, k), return(k))); }; A329030(n) = A329028(A276086(n)); CROSSREFS Cf. A134193, A276086, A276087, A329028. Sequence in context: A326702 A133563 A104518 * A027388 A114295 A004216 Adjacent sequences:  A329027 A329028 A329029 * A329031 A329032 A329033 KEYWORD nonn AUTHOR Antti Karttunen, Nov 07 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 September 23 03:40 EDT 2020. Contains 337291 sequences. (Running on oeis4.)