login
A264023
Suppose k is the concatenation of two integers, x and y: k = concat(x,y); a(n) is the smallest value of k such that x+y = prime(n).
0
11, 12, 14, 16, 29, 49, 89, 109, 122, 128, 130, 136, 140, 142, 146, 152, 158, 160, 166, 170, 172, 178, 182, 188, 196, 299, 499, 899, 1009, 1049, 1126, 1130, 1136, 1138, 1148, 1150, 1156, 1162, 1166, 1172, 1178, 1180, 1190, 1192, 1196, 1198, 1210, 1222, 1226, 1228, 1232
OFFSET
1,1
PROG
(PARI) vsums(k) = {vs = []; for (j=1, #digits(k)-1, vs = concat(vs, k\10^j+k % 10^j); ); vs; }
isokvs(vs, n) = for (j=1, #vs, if (vs[j]==n, return(1))); return(0);
findp(n) = {p = prime(n); k = 10; ok = 0; while (!ok, vs = vsums(k); ok = isokvs(vs, p); if (! ok, k++); ); k; } \\ Michel Marcus, Nov 13 2015
CROSSREFS
Sequence in context: A210767 A182404 A234021 * A177902 A108722 A246139
KEYWORD
nonn,base,easy
AUTHOR
Giovanni Teofilatto, Nov 01 2015
EXTENSIONS
More terms and better definition from Altug Alkan, Nov 13 2015
STATUS
approved