Let u be any string of n digits from {0,...,3}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-4 number; then a(n) = max_u f(u).

A065845

Let u be any string of n digits from {0,...,3}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-4 number; then a(n) = max_u f(u).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =6a(4) =13a(5) =36a(6) =96a(7) =253a(8) =765a(9) =2683a(10) =7385a(11) =25075a(12) =83150a(13) =293063a(14) =888689a(15) =3161645a(16) =11097301a(17) =40328876a(18) =129951350a(19) =469528189a(20) =1694632516

External references