cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A329030 The least missing nonzero digit in the primorial base expansion of A276086(n).

Original entry on oeis.org

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
Offset: 0

Views

Author

Antti Karttunen, Nov 07 2019

Keywords

Crossrefs

Programs

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

Formula

a(n) = A329028(A276086(n)) = A134193(A276087(n)) .