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).
A065851
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).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =11a(4) =39a(5) =148a(6) =731a(7) =4333a(8) =26519a(9) =152526a(10) =1251724a(11) =7627713a(12) =49545041a(13) =342729012
External references
- oeis: A065851