|
Search: id:A065849
|
|
|
| A065849 |
|
Let u be any string of n digits from {0,...,8}; 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 15 and 51 (in base 8) are primes.
|
|
CROSSREFS
|
Cf. A065843, A065844, A065845, A065846, A065847, A065848, A065850, A065851, A065852, A065853
Sequence in context: A141123 A119641 A074496 this_sequence A136402 A137811 A041955
Adjacent sequences: A065846 A065847 A065848 this_sequence A065850 A065851 A065852
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
|
|
Search completed in 0.002 seconds
|
