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 A331346 #15 Sep 08 2022 08:46:25 %S A331346 1049,1409,4019,4091,9041,10499,10949,14009,49019,49109,90149,90401, %T A331346 94109,99041,99401,100049,101149,101419,101449,104009,104119,104149, %U A331346 104491,104911,104999,109049,109141,109441,110419,110491,111049,111409,114901,140009,140191,140419 %N A331346 Primes using all the square digits {0, 1, 4, 9} and no others. %C A331346 Subsequence of A061246. %H A331346 Robert Israel, <a href="/A331346/b331346.txt">Table of n, a(n) for n = 1..10000</a> %e A331346 a(1) = 1049 is prime containing all the square digits (0, 1, 4, 9) and no others. %e A331346 a(2) = 1409 is prime containing all the square digits (0, 1, 4, 9) and no others. %p A331346 f:= proc(n) local L,x; %p A331346 L:= convert(n,base,4); %p A331346 if convert(L,set) <> {0,1,2,3} then return NULL fi; %p A331346 L:= subs(2=4,3=9,L); %p A331346 x:= add(L[i]*10^(i-1),i=1..nops(L)); %p A331346 if isprime(x) then x else NULL fi %p A331346 end proc: %p A331346 map(f, [$4^3..4^6]); # _Robert Israel_, Jan 16 2020 %t A331346 Select[FromDigits /@ Tuples[{0, 1, 4, 9}, 6], PrimeQ[#] && Union[IntegerDigits[#]] == {0, 1, 4, 9} &] %o A331346 (Magma) [p:p in PrimesUpTo(150000)|Set(Intseq(p)) eq {0,1,4,9}]; // _Marius A. Burtea_, Jan 14 2020 %Y A331346 Cf. A000040, A061246, A066591, A323387. %K A331346 nonn,base %O A331346 1,1 %A A331346 _K. D. Bajpai_, Jan 14 2020