OFFSET
1,1
COMMENTS
There may be more than one representation of that kind,
for example 2791 = 10*233+461 = 10*239+401 = 10*268+101 = 10*227+521 = 10*251+281 splits the 4-digit prime 2791 into two 3-digit primes in 5 different ways; only one instance (only one 2791 in the example) is added to the sequence then.
EXAMPLE
a(1)=23 = 10*2+3. a(3)= 53 = 10*5+3. a(5)= 127 = 11*10+17. 167= 10*13+37.
MAPLE
A055642 := proc(n) max(1, ilog10(n)+1) ; end:
isA129351 := proc(p) local np1, q, r ; if isprime(p) then np1 := A055642(p)-1 ; q := nextprime(10^(np1-1)) ; while q < 10^np1 do r := q ; while r < 10^np1 do if 10*q+r = p or 10*r+q = p then return true; end if ; r := nextprime(r) ; end do ; q := nextprime(q) ; end do ; false ; else false; end if; end proc:
for n from 5 to 400 do p := ithprime(n) ; if isA129351(p) then printf("%d, ", p) ; fi; od: # R. J. Mathar, Nov 02 2009
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
J. M. Bergot, May 28 2007
EXTENSIONS
Edited, 139 inserted and sequence extended - R. J. Mathar, Nov 02 2009
STATUS
approved