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 A260267 #21 Jul 14 2025 17:31:58
%S A260267 2,11,41,211,241,421,2111,2141,2221,2411,2441,4111,4211,4241,4421,
%T A260267 4441,11411,12211,12241,12421,14221,14411,21121,21211,21221,22111,
%U A260267 22441,24121,24421,41141,41221,41411,42221,44111,44221,111121,111211,112111,112121,112241
%N A260267 Primes having only {1, 2, 4} as digits.
%C A260267 A020450 and A020452 are subsequences.
%C A260267 All terms but the first one end with a digit "1". - _M. F. Hasler_, Jul 26 2015
%H A260267 Jason Bard, <a href="/A260267/b260267.txt">Table of n, a(n) for n = 1..10000</a>
%H A260267 <a href="/index/Pri#PrimesWithDigits">Index to entries about primes with digits in a given set</a>.
%t A260267 Select[Prime[Range[3 10^4]], Complement[IntegerDigits[#], {1, 4, 2}]=={} &]
%o A260267 (Magma) [p: p in PrimesUpTo(4*10^5) | Set(Intseq(p)) subset [1, 4, 2]];
%o A260267 (PARI) A260267(n=50,show=0)={for(d=1,1e9,my(t,u=vector(d,i,10^(d-i))~);forvec(v=vector(d,i,[0,if(i<d,2,d==1)]),ispseudoprime(t=vector(d,i,1<<v[i])*u)||next;show&&print1(t",");n--||return(t)))} \\ _M. F. Hasler_, Jul 25 2015
%Y A260267 Cf. similar sequences listed in A260266.
%Y A260267 Cf. A020450, A020452.
%K A260267 nonn,easy,base
%O A260267 1,1
%A A260267 _Vincenzo Librandi_, Jul 23 2015