|
Search: id:A094535
|
|
| |
|
| 1, 2, 13, 23, 113, 131, 137, 1013, 1031, 1273, 1237, 1379, 6173, 10139, 10193, 10379, 10397, 10937, 12397, 12379, 36137, 36173, 101397, 102371, 101937, 102973, 103917, 106937, 109371, 109739, 123797, 123917, 123719, 346137, 193719, 346173
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
C. Rivera, puzzle 265
|
|
FORMULA
|
<< DiscreteMath`Combinatorica`; a1[n_]:=(r=IntegerDigits[n];b=Length[r]; c[k_]:=Union[KSubsets[r, k]];d[k_]:=Length[c[k]]; f[k_]:=Table[FromDigits[c[k][[j]]], {j, d[k]}]; (A={};Do[A=Join[A, f[k]], {k, b}]);A=Union[A]; Count[PrimeQ[A], True]);a[n_]:=(For[m=1, a1[m]!=n, m++ ]; m)
|
|
EXAMPLE
|
a(6)=137 because 137 is the smallest number m such that A039995(m)=6; the six number 3,7,13,17,37 & 137 are primes.
|
|
CROSSREFS
|
Cf. A039995, A093301, A039997.
Adjacent sequences: A094532 A094533 A094534 this_sequence A094536 A094537 A094538
Sequence in context: A045388 A045389 A090528 this_sequence A035244 A085822 A093301
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), May 08 2004
|
|
|
Search completed in 0.002 seconds
|
