|
|
A065847
|
|
Let u be any string of n digits from {0,...,5}; let f(u) = number of distinct primes, not beginning with 0, formed by permuting the digits of u to a base-6 number; then a(n) = max_u f(u).
|
|
11
|
|
|
1, 2, 4, 8, 21, 60, 269, 1147, 4250, 17883, 71966, 342060, 1724337, 8428101, 37186164, 175845403
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
a(2)=2 because 15 and 51 (written in base 6) are primes (11 and 31).
|
|
MAPLE
|
local b, u, udgs, uperm, a;
b :=6 ;
a := 0 ;
for u from b^(n-1) to b^n-1 do
udgs := convert(u, base, b) ;
prs := {} ;
for uperm in combinat[permute](udgs) do
if op(-1, uperm) <> 0 then
p := add( op(i, uperm)*b^(i-1), i=1..nops(uperm)) ;
if isprime(p) then
prs := prs union {p} ;
end if;
end if;
end do:
a := max(a, nops(prs)) ;
end do:
a ;
end proc:
for n from 1 do
|
|
MATHEMATICA
|
c[x_] := Module[{},
Length[Select[Permutations[x],
First[#] != 0 && PrimeQ[FromDigits[#, 6]] &]]];
Return[Max[Map[c, DeleteDuplicatesBy[Tuples[Range[0, 5], n],
Table[Count[#, i], {i, 0, 5}] &]]]]];
|
|
PROG
|
(Python)
from sympy import isprime
from sympy.utilities.iterables import multiset_permutations
from itertools import combinations_with_replacement
return max(sum(1 for t in multiset_permutations(s) if t[0] != '0' and isprime(int(''.join(t), 6))) for s in combinations_with_replacement('012345', n)) # Chai Wah Wu, Apr 23 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|