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 A347323 #23 Sep 13 2021 12:39:19
%S A347323 0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,0,4,3,2,1,0,10,0,12,0,10,2,16,4,12,0,
%T A347323 10,20,0,12,20,0,12,26,3,0,10,20,31,0,10,24,35,0,14,0,10,20,32,42,0,
%U A347323 12,21,32,45,0,10,20,30,40,50,0,14,24,36,0,10,20,31,42,50
%N A347323 Replace each nonzero digit d of n by (n mod d).
%C A347323 The zero digits are preserved, but after the other digits have been changed leading zeros are of course omitted.
%H A347323 Michel Marcus, <a href="/A347323/b347323.txt">Table of n, a(n) for n = 0..10000</a>
%e A347323 a(23) = 12, since 23 mod 2 is 1, 23 mod 3 is 2.
%e A347323 a(24) = 0, since both 24 mod 2 and 24 mod 4 are 0.
%e A347323 a(25) = 10 since 25 mod 2 is 1, 25 mod 5 is 0.
%t A347323 a[0] = 0; a[n_] := FromDigits[Mod[n, IntegerDigits[n]/.{0->n}]]; Array[a, 100, 0] (* _Amiram Eldar_, Sep 13 2021 *)
%o A347323 (PARI) a(n) = my(d=digits(n)); fromdigits(vector(#d, k, if (d[k], n % d[k], 0))); \\ _Michel Marcus_, Sep 13 2021
%o A347323 (Python)
%o A347323 def A347323(n): return int(''.join('0' if d == '0' else str(n % int(d)) for d in str(n))) # _Chai Wah Wu_, Sep 13 2021
%Y A347323 Suggested by A346576.
%K A347323 nonn,base,look
%O A347323 0,15
%A A347323 _N. J. A. Sloane_, Sep 13 2021
%E A347323 More terms from _Stefano Spezia_, Sep 13 2021