login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A373832
a(n) = n mod A276150(n), where A276150 is the digit sum in the primorial base.
5
0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 0, 2, 0, 3, 0, 1, 2, 5, 0, 0, 1, 3, 4, 1, 0, 1, 0, 0, 1, 3, 0, 1, 2, 3, 0, 1, 0, 3, 0, 0, 1, 5, 0, 4, 0, 3, 4, 4, 4, 1, 2, 1, 2, 3, 0, 1, 2, 3, 0, 0, 0, 3, 0, 4, 0, 5, 0, 3, 4, 3, 4, 0, 3, 1, 2, 4, 5, 3, 0, 1, 2, 7, 0, 8, 0, 3, 0, 3, 4, 5, 0, 2, 3, 3, 4, 3, 2, 1, 2, 0
OFFSET
1,5
FORMULA
a(n) = A373850(A276086(n)).
PROG
(PARI)
A276150(n) = { my(s=0, p=2, d); while(n, d = (n%p); s += d; n = (n-d)/p; p = nextprime(1+p)); (s); };
A373832(n) = (n % A276150(n));
CROSSREFS
Cf. A276086, A276150, A333426 (positions of 0's), A373833, A373834, A373850.
Sequence in context: A078979 A063974 A144628 * A286604 A366784 A217540
KEYWORD
nonn,base
AUTHOR
Antti Karttunen, Jun 19 2024
STATUS
approved