A373832 a(n) = n mod A276150(n), where A276150 is the digit sum in the primorial base.

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

Author

Antti Karttunen, Jun 19 2024

Keywords

• nonn
• base

Links

• Antti Karttunen, Table of n, a(n) for n = 1..100000
• Index entries for sequences related to primorial base

Crossrefs

Cf. A276086, A276150, A333426 (positions of 0's), A373833, A373834, A373850.

Programs

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

Formula

a(n) = A373850(A276086(n)).