|
Search: id:A065850
|
|
|
| A065850 |
|
Let u be any string of n digits from {0,...,9}; 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
|
|
| 1, 2, 5, 11, 39, 161, 865, 4604, 22636, 161107, 840691
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2)=2 because 12 and 21 (in base 9) are primes.
|
|
CROSSREFS
|
Cf. A065843, A065844, A065845, A065846, A065847, A065848, A065849, A065851, A065852, A065853
Sequence in context: A056301 A001344 A056302 this_sequence A106886 A007700 A071313
Adjacent sequences: A065847 A065848 A065849 this_sequence A065851 A065852 A065853
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
|
EXTENSIONS
|
2 more terms Sean A. Irvine (sairvin(AT)xtra.co.nz), Sep 06 2009
|
|
|
Search completed in 0.005 seconds
|
