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 A329150 #48 Mar 29 2023 14:39:37 %S A329150 0,2,3,5,7,11,13,17,19,20,22,23,25,27,30,32,33,35,37,50,52,53,55,57, %T A329150 70,72,73,75,77,110,112,113,115,117,130,132,133,135,137,170,172,173, %U A329150 175,177,190,192,193,195,197,200,202,203,205,207,211,213,217,219,220 %N A329150 Increasingly ordered list without repetition of numbers k that are obtained, when, for nonnegative integers n, each nonzero digit d is replaced with prime(d). %C A329150 As A329147 is not increasing, not decreasing, not surjective, not injective, another possible name could be: Terms of A329147 in increasing order without repetition. %C A329150 No term can have digits 4, 6 or 8; also, no term begins with 9, 10, 12, 15, 29, 39, 59 or 79. %C A329150 First primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 37, 53, ... %C A329150 First squares are 0, 25, 225, 2025, 2500, 3025, 7225, ... %C A329150 First palindromes are 0, 2, 3, 5, 7, 11, 22, 33, 55, 77, 202, 222, 232, ... %H A329150 Michel Marcus, <a href="/A329150/b329150.txt">Table of n, a(n) for n = 1..5365</a> %e A329150 Prime(1) = 2, prime(5) = 11, so A329147(15) = 211 and 211 is a term. %o A329150 (PARI) f(n) = if (n, fromdigits(concat(apply(d -> if (d, digits(prime(d)), [0]), digits(n)))), 0); \\ A329147 %o A329150 lista(nn) = my(list = List(), m); for (n=0, nn, m = f(n); if (m <= nn, listput(list, m));); Set(list); \\ _Michel Marcus_, Mar 26 2023 %Y A329150 Cf. A329147, A329149 (complement). %K A329150 nonn,base %O A329150 1,2 %A A329150 _Bernard Schott_, Jan 11 2020