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 A260266 #24 Jul 20 2025 17:46:18
%S A260266 11,41,101,401,4001,4111,4441,10111,10141,11411,14011,14401,14411,
%T A260266 40111,41011,41141,41411,44041,44101,44111,100411,101111,101141,
%U A260266 101411,110441,114001,114041,140111,140401,140411,141041,141101,400441,401101,401411,404011
%N A260266 Primes having only {0, 1, 4} as digits.
%C A260266 A020449 and A020452 are subsequences.
%C A260266 All terms end with a digit "1". - _M. F. Hasler_, Jul 26 2015
%H A260266 Alois P. Heinz, <a href="/A260266/b260266.txt">Table of n, a(n) for n = 1..10000</a>
%H A260266 <a href="/index/Pri#PrimesWithDigits">Index to entries for primes with digits in a given set</a>
%t A260266 Select[Prime[Range[4 10^4]], Complement[IntegerDigits[#], {1, 4, 0}]=={} &]
%o A260266 (Magma) [p: p in PrimesUpTo(5*10^5) | Set(Intseq(p)) subset [1, 4, 0]];
%o A260266 (PARI) A260266(n=50,show=0)={for(d=1,1e9,my(t,u=vector(d,i,10^(d-i))~);forvec(v=vector(d,i,[i==1||i==d,1+(i<d)]),ispseudoprime(t=vector(d,i,v[i]^2)*u)||next;show&&print1(t",");n--||return(t)))} \\ _M. F. Hasler_, Jul 25 2015
%Y A260266 Primes that contain only digits among {1,4,k}: this sequence (k=0), A260267 (k=2), A199341 (k=3), A260268 (k=5), A260269 (k=6), A079651 (k=7), A260270 (k=8), A260271 (k=9).
%Y A260266 Cf. A020449, A020452.
%Y A260266 Cf. A020450 - A020472, A036953, A260044, A260267 - A260271, A199325 - A199329, A061247, A199340 - A199349.
%K A260266 nonn,easy,base
%O A260266 1,1
%A A260266 _Vincenzo Librandi_, Jul 22 2015