|
Search: id:A065845
|
|
|
| A065845 |
|
Let u be any string of n digits from {0,...,4}; 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, 3, 6, 13, 36, 96, 253, 765, 2683, 7385, 25075, 83150, 293063, 888689
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2)=2 because 13 and 31 (in base 4) are primes.
|
|
CROSSREFS
|
Cf. A065843, A065844, A065846, A065847, A065848, A065849, A065850, A065851, A065852, A065853
Sequence in context: A076836 A117403 A002877 this_sequence A137273 A135967 A134737
Adjacent sequences: A065842 A065843 A065844 this_sequence A065846 A065847 A065848
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
|
|
Search completed in 0.002 seconds
|
