login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328578 Index of the least prime not dividing A276086(A276086(n)): a(n) = A257993(A276087(n)). 25
2, 1, 3, 1, 4, 1, 3, 1, 4, 1, 5, 1, 2, 1, 5, 1, 4, 1, 3, 1, 6, 1, 6, 1, 2, 1, 6, 1, 7, 1, 2, 1, 4, 1, 3, 1, 3, 1, 5, 1, 6, 1, 2, 1, 6, 1, 6, 1, 3, 1, 7, 1, 7, 1, 2, 1, 7, 1, 5, 1, 2, 1, 5, 1, 4, 1, 3, 1, 6, 1, 6, 1, 2, 1, 7, 1, 7, 1, 3, 1, 7, 1, 8, 1, 2, 1, 6, 1, 8, 1, 2, 1, 6, 1, 7, 1, 3, 1, 7, 1, 7, 1, 2, 1, 7, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Index of the least significant zero digit in the primorial base expansion of A276086(n), when the rightmost digit is in the position 1.
The scatter plot shows both regular looking as well as more chaotic regions. This can be more clearly seen in related A328579. See also A328839.
LINKS
FORMULA
a(n) = A328570(A276086(n)) = A257993(A276087(n)) = A055396(A328403(n)).
a(n) = A000720(A328579(n)).
a(n) = A257993(n) + A328590(n).
a(n) = A055396(A328763(n)).
For all n >= 0, a(A328761(n)) = n.
PROG
(PARI)
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A328570(n) = { my(i=1, p=2); while(n && (n%p), i++; n = n\p; p = nextprime(1+p)); (i); };
(PARI)
A257993(n) = { for(i=1, oo, if(n%prime(i), return(i))); }
CROSSREFS
Cf. A328585 (where equal with A257993), A328587 (less than), A328588 (greater than).
Cf. A328761 (the first occurrence of each n).
Cf. also array A328631 and its rows A005408, A328632, A328633, A328634, A328635, A328636 (positions of terms 1 .. 6 in this sequence).
Sequence in context: A229944 A366421 A218533 * A351613 A094741 A360653
KEYWORD
nonn,look
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 30 04:46 EDT 2024. Contains 374734 sequences. (Running on oeis4.)