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.
%I A328841 #8 Nov 01 2019 18:39:54 %S A328841 0,1,2,3,2,3,6,7,8,9,8,9,6,7,8,9,8,9,6,7,8,9,8,9,6,7,8,9,8,9,30,31,32, %T A328841 33,32,33,36,37,38,39,38,39,36,37,38,39,38,39,36,37,38,39,38,39,36,37, %U A328841 38,39,38,39,30,31,32,33,32,33,36,37,38,39,38,39,36,37,38,39,38,39,36,37,38,39,38,39,36,37,38,39,38,39,30 %N A328841 Substitute ones for all nonzero digits in primorial base expansion of n, then convert back to decimal. %H A328841 Antti Karttunen, <a href="/A328841/b328841.txt">Table of n, a(n) for n = 0..30029</a> %H A328841 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %F A328841 a(n) = n - A328842(n). %F A328841 a(n) = A276085(A328571(n)) = A276085(A007947(A276086(n))). %F A328841 For all n>= 0, a(A276086(n)) = A328843(n). %F A328841 For all n >= 1, A257993(a(n)) = A257993(n). %F A328841 For all n >= 0, A328570(a(n)) = A328570(n), A328620(a(n)) = A328620(n), and A267263(a(n)) = A267263(n). %o A328841 (PARI) A328841(n) = { my(p=2, r=1, s=0); while(n, s += ((!!(n%p))*r); r *= p; n = n\p; p = nextprime(1+p)); (s); }; %Y A328841 Cf. A002110, A007947, A257993, A267263, A276085, A276086, A328570, A328571, A328620, A328842, A328843. %Y A328841 Cf. A276156 (fixed points). %Y A328841 Cf. A276008 for analogous sequence. %K A328841 nonn,base %O A328841 0,3 %A A328841 _Antti Karttunen_, Oct 30 2019