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 A199346 #21 Jul 14 2025 17:29:28
%S A199346 3,43,433,443,463,643,3343,3433,3463,3643,4363,4463,4643,4663,6343,
%T A199346 33343,36343,36433,36643,43633,44633,46633,46643,46663,63443,63463,
%U A199346 64333,64433,64633,64663,66343,66463,66643,333433,334333,334363,334643,336463,336643,343333,343433,344363,346433,363343,363463,364333,364433,364643
%N A199346 Primes having only {3, 4, 6} as digits.
%C A199346 All terms end in 3 and have a number of digits '4' that is not divisible by 3.
%C A199346 A020461 is a subsequence. - _Vincenzo Librandi_, Jul 29 2015
%H A199346 Jason Bard, <a href="/A199346/b199346.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harvey P. Dale)
%t A199346 Select[Flatten[Table[FromDigits/@(Flatten[{#,3},1]&/@Tuples[{3,4,6},n]),{n,0,5}]],PrimeQ] (* _Harvey P. Dale_, Jan 01 2013 *)
%t A199346 Select[Prime[Range[10^5]], Complement[IntegerDigits[#], {3, 4, 6}]=={}&] (* _Vincenzo Librandi_, Jul 28 2015 *)
%o A199346 (PARI) a(n, list=0, L=[3, 4, 6], reqpal=0)={my(t); for(d=1, 1e9, u=vector(d, i, 10^(d-i))~; forvec(v=vector(d, i, [1+(i==1&!L[1]), #L]), isprime(t=vector(d, i, L[v[i]])*u) || next; reqpal & !isprime(A004086(t)) & next; list & print1(t", "); n--||return(t)))}
%o A199346 (Magma) [p: p in PrimesUpTo(4*10^5) | Set(Intseq(p)) subset [3, 4, 6]]; // _Vincenzo Librandi_, Jul 29 2015
%Y A199346 Cf. A020449 - A020472, A199325 - A199329, A385768 - A385800.
%Y A199346 Cf. similar sequences listed in A199340.
%K A199346 nonn,easy,base
%O A199346 1,1
%A A199346 _M. F. Hasler_, Nov 05 2011