cp's OEIS Frontend

A155476 Primes p such that p and the p-th prime have the same largest digit.

%I A155476 #12 Feb 14 2019 05:58:58
%S A155476 7,29,37,73,97,109,137,139,149,181,239,271,281,283,293,307,367,379,
%T A155476 397,419,449,499,557,577,593,599,631,659,691,733,751,839,877,881,883,
%U A155476 911,919,971,977,1109,1129,1193,1229,1249,1283,1289,1291,1307,1429,1489
%N A155476 Primes p such that p and the p-th prime have the same largest digit.
%H A155476 Jinyuan Wang, <a href="/A155476/b155476.txt">Table of n, a(n) for n = 1..10000</a>
%e A155476 7 (prime) is a term because prime(7)=17 and 7 and 17 have 7 as their largest digit.
%e A155476 29 (prime) is a term because prime(29)=109 and 29 and 109 have 9 as their largest digit.
%e A155476 37 (prime) is a term because prime(37)=157 and 37 and 157 have 7 as their largest digit.
%p A155476 A054055 := proc(n) max( op(convert(n,base,10)) ) ; end proc:
%p A155476 for n from 2 to 2200 do if isprime(n) then if A054055(n) = A054055(ithprime(n)) then printf("%d,",n) ; end if; end if; end do: # _R. J. Mathar_, May 10 2010
%o A155476 (PARI) forprime(p=1,1489,if(vecmax(digits(p))==vecmax(digits(prime(p))),print1(p,", "))) \\ _Jinyuan Wang_, Feb 13 2019
%Y A155476 Cf. A000040 (primes), A054055, A060418.
%K A155476 nonn,base
%O A155476 1,1
%A A155476 _Juri-Stepan Gerasimov_, Jan 23 2009
%E A155476 Most terms > 300 corrected by _R. J. Mathar_, May 10 2010