|
Search: id:A100369
|
|
|
| A100369 |
|
Largest primes arising in A099756 which were built up from n distinct digits. This sequence differs from A007810 because more than one copy of each digit is permitted. |
|
+0
2
|
|
| 11, 787, 22259, 70879, 607889, 4456789, 40456789, 304456879, 1123465789, 10123457689
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
These primes are "largest among earliest primes" at fixed number of distinct digits chosen from A099756. Their position in A099756 are: {1,27,90,198,440,774,858,930,949,950}.
|
|
EXAMPLE
|
n=3: a[3]=22259, built up from the 3-subset = {2,5,9} of decimal digits.
It appears in A099756 as the 90th term. It is by definition of A099756 is
the smallest prime that can be constructed from {2,5,9} and at the same time
it is the largest prime if running through all 3-subsets of decimal digits.
All terms includes at least 2 copies of some digit.
Differs from A007810[3]=983.
|
|
CROSSREFS
|
Cf. A099651, A099653, A099654, A007809, A007810, A099756.
Sequence in context: A028457 A110776 A058392 this_sequence A162448 A024150 A052071
Adjacent sequences: A100366 A100367 A100368 this_sequence A100370 A100371 A100372
|
|
KEYWORD
|
fini,full,nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Nov 29 2004
|
|
|
Search completed in 0.002 seconds
|
