|
Search: id:A073064
|
|
|
| A073064 |
|
Primes with non-distinct digits. |
|
+0
3
|
|
| 11, 101, 113, 131, 151, 181, 191, 199, 211, 223, 227, 229, 233, 277, 311, 313, 331, 337, 353, 373, 383, 433, 443, 449, 499, 557, 577, 599, 661, 677, 727, 733, 757, 773, 787, 797, 811, 877, 881, 883, 887, 911, 919, 929, 977, 991, 997, 1009, 1013, 1019
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
A000040 INTERSECT A109303. R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 1 2008
|
|
EXAMPLE
|
a(1)=11 because 11 is the first prime not all digits of which are distinct; a(2)=101 because 101 is the second prime not all digits of which are distinct
|
|
MAPLE
|
A055642 := proc(n) max(ilog10(n)+1, 1) ; end: A043537 := proc(n) nops(convert(convert(n, base, 10), set)) ; end: isA109303 := proc(n) RETURN( A055642(n) > A043537(n) ) ; end: isA073064 := proc(n) RETURN(isprime(n) and isA109303(n) ) ; end: for n from 1 to 1019 do if isA073064(n) then printf("%d, ", n) ; fi ; od: # R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 1 2008
|
|
MATHEMATICA
|
ta=IntegerDigits[Prime[Range[1000]]]; ta2=Table[Length[ta[[i]]]>Length[Union[ta[[i]]]], {i, 1000}]; Prime[Flatten[Position[ta2, True]]]
|
|
CROSSREFS
|
Cf. A030291, A073069.
Sequence in context: A117697 A091366 A158051 this_sequence A155075 A062697 A062696
Adjacent sequences: A073061 A073062 A073063 this_sequence A073065 A073066 A073067
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com) Aug 24 2002
|
|
|
Search completed in 0.002 seconds
|
