OFFSET
1,3
COMMENTS
Inclusion of the single-digit terms is conventional: here the property is vacuously satisfied since no sum can be constructed by inserting a + sign between two digits, therefore all possible sums are prime. (It is not allowed to prefix a leading zero (e.g., to forbid 4 = 04 = 0+4) since in that case all terms must be prime and one would get A089392.)
The restriction on leading zeros means that numbers with digit 0 other than in the last position are excluded, so this sequence equals A252996 with terms in A252480 removed.
Since all primes > 2 are odd, all terms different from 11 and 20 have the last digit of opposite parity to that of all other digits.
As A252996, this sequence is "finite" (without rigorous proof), and up to 5e16 the only terms with more than 11 digits are 5391391551358 and 97393713331910, the latter being probably the largest element of this sequence (due to Giovanni Resta).
(See links for "intellectual ownership": The sequence (without single-digit terms) was suggested by Eric Angelini, a first list of terms computed by Lars Blomberg, then others. Hans Havermann observed that this is a variant of what had been termed "magnanimous numbers" at least 10 years ago by A. Murthy, G. Resta and/or C. Rivera, cf. A089392 and links.)
LINKS
M. F. Hasler, Table of n, a(n) for n = 1..452
E. Angelini and L. Blomberg, Insert "+" and always get a prime, Dec 2014
G. Resta, magnanimous numbers, 2013.
C. Rivera, Puzzle 401. Magnanimous primes, 2007.
EXAMPLE
110 is in the sequence since 1+10=11 and 11+0 = 11 are both prime.
101 is not in the sequence because although 10+1 = 11 and 1+01 = 2 are prime, the latter sum is forbidden since 01 has a leading zero.
Number, smallest and largest of the n-digit terms:
| n # min max
| 1 10 0 9
| 2 33 11 98
| 3 69 110 998
| 4 90 1112 9910
| 5 81 11116 99998
| 6 71 111112 999994
| 7 54 1115756 9959374
| 8 25 11771992 95559998
| 9 9 117711170 995955112
|10 4 1777137770 9151995592
|11 4 22226226625 46884486265
|12 0 -
|13 1 5391391551358
|14 1 97393713331910
|15 0 -
PROG
(PARI) is(n)=!for(i=1, #Str(n)-1, ispseudoprime([1, 1]*(divrem(n, 10^i)))||return)&&(n<100||vecmin(digits(n\10)))
t=0; vector(100, i, until(is(t++), ); t)
CROSSREFS
KEYWORD
nonn,base,nice,fini,full
AUTHOR
M. F. Hasler, Dec 28 2014
STATUS
approved