|
Search: id:A156851
|
|
|
| A156851 |
|
Primes such that largest digit odd of n = largest digit odd of n-th prime. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
For n=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: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2009]
|
|
CROSSREFS
|
Cf. A000040.
Sequence in context: A080441 A135400 A052254 this_sequence A141921 A157099 A108649
Adjacent sequences: A156848 A156849 A156850 this_sequence A156852 A156853 A156854
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Feb 17 2009
|
|
EXTENSIONS
|
Missing numbers inserted by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 20 2009
|
|
|
Search completed in 0.002 seconds
|
