|
| |
|
|
A065852
|
|
Let u be any string of 3 digits from {0,...,n}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u; then a(n) = max_u f(u).
|
|
10
| |
|
|
1, 2, 3, 4, 4, 5, 3, 5, 4, 6, 4, 6, 4, 5, 5, 5, 4, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 6, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,2
|
|
|
COMMENTS
| a(192)=5 and a(n)=6 for all 73<n<985
|
|
|
EXAMPLE
| a(2)=1 because 101 is prime and there are no two 3-digit primes with the same number of ones in base two.
|
|
|
CROSSREFS
| Cf. A065843, A065844, A065845, A065846, A065847, A065848, A065849, A065850, A065851, A065853
Sequence in context: A057951 A076410 A058277 * A088807 A036371 A036370
Adjacent sequences: A065849 A065850 A065851 * A065853 A065854 A065855
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
| |
|
|
