|
Search: id:A065843
|
|
|
| A065843 |
|
Let u be any string of n digits from {0,...,2}; 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
|
|
| 0, 1, 1, 2, 2, 3, 5, 12, 11, 24, 34, 79, 105, 194, 362, 734, 1143, 2045, 3872, 7758, 13001, 23902, 45539, 90436, 159510, 296210, 563833, 1110387, 2030754, 3876871, 7333827, 14353074, 26730538, 51246344, 97529176, 190928828
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
a(4)=2 because 1011 and 1101 in base-2-notation are primes and there are no three 4-digit primes with the same number of ones.
|
|
CROSSREFS
|
Cf. A065844, A065845, A065846, A065847, A065848, A065849, A065850, A065851, A065852, A065853
Sequence in context: A005426 A014644 A089541 this_sequence A111264 A065994 A152446
Adjacent sequences: A065840 A065841 A065842 this_sequence A065844 A065845 A065846
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
|
EXTENSIONS
|
6 more terms Sean A. Irvine (sairvin(AT)xtra.co.nz), Sep 06 2009
|
|
|
Search completed in 0.002 seconds
|
