A156851 Primes p=prime(k) such that the largest digit of k is odd and is equal to the largest digit of p.

17, 109, 113, 131, 157, 251, 367, 373, 479, 491, 499, 509, 599, 773, 797, 859, 937, 1009, 1129, 1193, 1289, 1303, 1327, 1499, 1553, 1567, 1579, 1733, 1741, 1747, 1753, 1777, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 2027, 2039

Offset

1,1

Links

Table of n, a(n) for n=1..45.

Example

For p=7=odd, prime(7)=17 (1<7=odd); n=29 (2<9=odd), prime(29)=109 (0<1<9=odd), etc.

Maple

A054055 := proc(n) max(op(convert(n, base, 10))) ; end:
for n from 1 to 400 do
  ldn := A054055(n) ;
  if type(ldn, odd) then
    p := ithprime(n) ;
    ldp := A054055(p) ;
    if ldp = ldn then
      printf("%d, ", p) ;
    fi;
  fi;
od: # R. J. Mathar, Feb 20 2009

Prog

(PARI) is(n) = vp = vecmax(digits(n)); if(vp % 2 == 0, return(0)); vpp = vecmax(digits(primepi(n))); vp == vpp \\ David A. Corneth, Jan 22 2019

Crossrefs

Cf. A000040, A054055.

Sequence in context: A135400 A372583 A052254 * A354183 A141921 A013308

Adjacent sequences: A156848 A156849 A156850 * A156852 A156853 A156854

Keyword

nonn,base

Author

Juri-Stepan Gerasimov, Feb 17 2009

Extensions

Missing numbers inserted by R. J. Mathar, Feb 20 2009

Name corrected by Jon E. Schoenfield, Jan 22 2019

Status

approved