|
Search: id:A065851
|
|
|
| A065851 |
|
Let u be any string of n digits from {0,...,10}; 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). |
|
+0
11
|
| |
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2)=2 because 13 and 31 are primes.
|
|
CROSSREFS
|
Cf. A065843, A065844, A065845, A065846, A065847, A065848, A065849, A065850, A065852, A065853
Adjacent sequences: A065848 A065849 A065850 this_sequence A065852 A065853 A065854
Sequence in context: A118182 A107107 A101898 this_sequence A013044 A110577 A012948
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
|
|
Search completed in 0.002 seconds
|
