|
%I #10 Jul 22 2013 08:12:44
%S 131,64279,64319,64483,64513,64621,10708553,211689713,1473469351,
%T 14655469571,16744452731,20921000803,1868659342061,2075982751859,
%U 2490551934503,3112244742829
%N Primes p = prime(k) such that the representation of p can be split in two parts whose sum is k.
%C a(17) > 4*10^12.
%e prime(20+921000803) = 20921000803.
%t Reap[Do[k = 1; p = Prime@n; While[(k *= 10) < p, If[Mod[p, k] + Floor[p/k] == n, Sow@p]], {n, 9000}]][[2, 1]]
%Y Cf. A112013, A224827.
%K nonn,base
%O 1,1
%A _Giovanni Resta_, Jul 22 2013
|
