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 A036954 #24 Feb 19 2023 16:20:35 %S A036954 2,4,10,22,34,46,58,67,79,94,103,139,145,157,166,169,172,181,190,193, %T A036954 199,205,211,214,229,277,283,295,298,307,313,349,367,373,391,394,409, %U A036954 421,433,439,463,466,478,505,517,523,529,535,541,547,556,559,571,577 %N A036954 Primes with digits in {0,1,2} taken as base 3 and converted to base 10. %C A036954 Equivalently: terms of A036953 read in base 3 (and written in base 10). - _M. F. Hasler_, Jul 25 2015 %C A036954 Equivalently, k such that A007089(k), read literally as a decimal number, is a prime. - _N. J. A. Sloane_, Feb 17 2023 %H A036954 Iain Fox, <a href="/A036954/b036954.txt">Table of n, a(n) for n = 1..10000</a> %H A036954 <a href="/index/Mo#MWP">Index entries for sequences related to Most Wanted Primes video</a> %F A036954 a(n) == 1 (mod 3) for all n > 1. - _M. F. Hasler_, Jul 25 2015 %e A036954 a(n) = 313 is 102121{3}, and 102121{10} is prime. %t A036954 FromDigits[#,3]&/@Select[Tuples[{0,1,2},6],PrimeQ[FromDigits[#]]&] (* _Harvey P. Dale_, Mar 27 2021 *) %o A036954 (PARI) is(n)=(n%3==1||n==2)&&isprime((n=digits(n,3))*vectorv(#n,i,10^(#n-i))) \\ _M. F. Hasler_, Jul 25 2015 %Y A036954 Cf. A036952-A036964. %Y A036954 Indices of primes in A007089. %K A036954 nonn,base %O A036954 1,1 %A A036954 _Patrick De Geest_, Jan 04 1999 %E A036954 Offset corrected to 1 and minor edits by _M. F. Hasler_, Jul 25 2015