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!)
 A329028 The least missing nonzero digit in the primorial base expansion of n. 5
 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 3, 3, 1, 3, 3, 3, 1, 3, 1, 2, 2, 2, 1, 4, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 3, 3, 1, 3, 3, 3, 1, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 3, 1, 3, 1, 4, 4, 4, 1, 4, 1, 3, 3, 3, 1, 3, 1, 2, 2, 2, 1, 4, 2, 2, 2, 2, 4, 4, 1, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Antti Karttunen, Table of n, a(n) for n = 0..32786 FORMULA a(n) = A134193(A276086(n)) = A257993(A328835(n)). a(A276086(n)) = A329030(n). EXAMPLE 19 in primorial base (A049345) is written as "301". The least missing nonzero digit is 2, thus a(19) = 2. 809 in primorial base is written as "35421". The least missing nonzero digit is 6, thus a(809) = 6, and this is also the first position where 6 appears in this sequence. PROG (PARI) 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))); }; CROSSREFS Cf. A049345, A134193, A257993, A276086, A328835, A329027, A329030. Cf. A328840 (the positions of ones in this sequence). Cf. A257079 for analogous sequence. Sequence in context: A194326 A295277 A194290 * A257079 A260372 A037180 Adjacent sequences:  A329025 A329026 A329027 * A329029 A329030 A329031 KEYWORD nonn,base AUTHOR Antti Karttunen, Nov 03 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 February 17 23:35 EST 2020. Contains 332006 sequences. (Running on oeis4.)