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 A380490 #16 May 21 2025 01:35:42 %S A380490 1,0,0,4,0,6,0,8,9,10,11,10,10,14,10,16,10,18,19,0,1,0,0,4,0,6,0,8,9, %T A380490 0,1,0,0,4,0,6,0,8,9,40,41,40,40,44,40,46,40,48,49,0,1,0,0,4,0,6,0,8, %U A380490 9,60,61,60,60,64,60,66,60,68,69,0,1,0,0,4,0,6,0,8,9,80,81,80 %N A380490 Replace prime digits of n by 0's. %H A380490 Robert Israel, <a href="/A380490/b380490.txt">Table of n, a(n) for n = 1..10000</a> %F A380490 a(A084984(n)) = A084984(n). %F A380490 a(A046034(n)) = 0. %e A380490 n = 7: 7 --> 0, thus a(7) = 0. %e A380490 n = 26: 26 --> 06, thus a(26) = 6. %e A380490 n = 472: 472 --> 400, thus a(472) = 400. %p A380490 f:= proc(n) local L,i; %p A380490 L:= convert(n,base,10); %p A380490 add(`if`(isprime(L[i]),0,L[i]) * 10^(i-1),i=1..nops(L)) %p A380490 end proc: %p A380490 map(f, [$1..100]); # _Robert Israel_, May 18 2025 %t A380490 a[n_] := FromDigits[IntegerDigits[n] /. _?PrimeQ -> 0]; Array[a, 100] (* _Amiram Eldar_, Jan 25 2025 *) %o A380490 (Python) %o A380490 def a(n): return int(str(n).translate({50:48,51:48,53:48,55:48})) %o A380490 print([a(n) for n in range(1, 83)]) # _Michael S. Branicky_, Jan 25 2025 %Y A380490 Cf. A046034, A084984. %K A380490 nonn,base,look %O A380490 1,4 %A A380490 _Ctibor O. Zizka_, Jan 25 2025