|
Search: id:A065847
|
|
|
| A065847 |
|
Let u be any string of n digits from {0,...,6}; 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, 4, 8, 21, 60, 269, 1147, 4250, 17883, 71966, 342060, 1724337
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
a(2)=2 because 15 and 51 (in base 6) are primes.
|
|
CROSSREFS
|
Cf. A065843, A065844, A065845, A065846, A065848, A065849, A065850, A065851, A065852, A065853
Sequence in context: A162110 A108071 A055876 this_sequence A133604 A115778 A027713
Adjacent sequences: A065844 A065845 A065846 this_sequence A065848 A065849 A065850
|
|
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.002 seconds
|
