|
|
A173935
|
|
a(n) is the least prime that is the concatenation of two primes in exactly n different ways.
|
|
0
|
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
EXAMPLE
|
23 = 2 & 3, 313 = 3 & 13 and 31 & 3, etc.
|
|
MATHEMATICA
|
f[n_] := Block[{c = 0, id = IntegerDigits@n, k = 0}, len = Length@ id; While[ k < len, If[ Union@ PrimeQ[ FromDigits@# & /@ {id[[;; k + 1]], id[[k + 2 ;; ]]}] == {True}, c++ ]; k++ ]; c]; t = Table[0, {10}]; p = 2; While[p < 10^8, a = f@p; If[ t[[a]] == 0, t[[a]] = p; Print[{a, p}]]; p = NextPrime@ p]
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|