Let u be any string of 3 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).

A065852

Let u be any string of 3 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) =1a(1) =2a(2) =3a(3) =4a(4) =4a(5) =5a(6) =3a(7) =5a(8) =4a(9) =6a(10) =4a(11) =6a(12) =4a(13) =5a(14) =5a(15) =5a(16) =4a(17) =6a(18) =5a(19) =6a(20) =5a(21) =6a(22) =5a(23) =6a(24) =5a(25) =6a(26) =5a(27) =6a(28) =5a(29) =6

External references