Let u be any string of 4 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).
A065853
Let u be any string of 4 digits from {0,...,n-1}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-n number; then a(n) = max_u f(u).
Terms
- a(0) =2a(1) =4a(2) =6a(3) =7a(4) =8a(5) =15a(6) =11a(7) =11a(8) =11a(9) =15a(10) =15a(11) =19a(12) =11a(13) =14a(14) =15a(15) =14a(16) =11a(17) =16a(18) =13a(19) =18a(20) =14a(21) =14a(22) =14a(23) =16a(24) =13a(25) =16a(26) =15a(27) =17a(28) =13a(29) =16
External references
- oeis: A065853