Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Dec 01 2017 00:52:33
%S 13,23,47,53,61,79,83,89,103,107,151,179,181,197,227,257,277,281,283,
%T 311,313,331,347,353,389,409,569,601,607,631,643,647,653,701,709,739,
%U 743,761,769,797,821,823,827,829,857,859,877,881,883,929,947,991,997
%N Primes p such that largest digit of prime(p) is even.
%H Iain Fox, <a href="/A154863/b154863.txt">Table of n, a(n) for n = 1..10000</a>
%p A054055 := proc(n) max( op(convert(n,base,10))) ; end: isA154863 := proc(n) isprime(n) and ( A054055(ithprime(n)) mod 2 ) = 0 ; end: for n from 1 to 1200 do if isA154863(n) then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Jan 18 2009
%t Select[Prime[Range[200]],EvenQ[Max[IntegerDigits[Prime[#]]]]&] (* _Harvey P. Dale_, Sep 05 2015 *)
%o (PARI) is(p) = isprime(p) && vecmax(digits(prime(p)))%2==0 \\ _Iain Fox_, Nov 30 2017
%Y Cf. A000040, A154767.
%K nonn,base,less
%O 1,1
%A _Juri-Stepan Gerasimov_, Jan 16 2009
%E 613, 617, 619 removed by _R. J. Mathar_, Jan 18 2009