|
| |
|
|
A065853
|
|
Let u be any string of 4 digits from {0,...,n}; 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).
|
|
10
| |
|
|
2, 4, 6, 7, 8, 15, 11, 11, 11, 15, 15, 19, 11, 14, 15, 14, 11, 16, 13, 18, 14, 14, 14, 16, 13, 16, 15, 17, 13, 16, 14, 15, 17, 16, 15, 16, 14, 17, 14, 17, 16, 17, 14, 16, 15, 15, 14, 17, 17, 16, 16, 16, 15, 18, 16, 17, 14, 15, 14, 16, 15, 15, 16, 16, 17, 17, 13, 17, 15, 17, 13
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
EXAMPLE
| a(2)=2 because 1101 and 1011 are primes and there are no three 4-digit primes with the same number of ones in base 2.
|
|
|
CROSSREFS
| Cf. A065843, A065844, A065845, A065846, A065847, A065848, A065849, A065850, A065851, A065852
Sequence in context: A096750 A088458 A177866 * A048284 A026516 A186493
Adjacent sequences: A065850 A065851 A065852 * A065854 A065855 A065856
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Nov 24 2001
|
| |
|
|
