[seqfan] smallest emirp to be the sum of an emirp number of composites

[Jonathan Post]

It seems to me after looking at A073620  a(1) = 0; a(n) = smallest
prime number which is a sum of n distinct composite numbers that:

179 is the smallest emirp to be the sum of an emirp number of
composites, as A073620(13) = 179, R(13)=31 is prime, R(179) = 971 is
prime.

Likewise, the next such value is 1103, as A073620(37) = 1103, R(37) =
73 is prime, R(1103) = 3011 is prime.

What are the 3rd, 4th, 5th and so forth? Using successively larger
emirp numbers of digits, or without that constraint (2 different
seqs)?

Is either a seq worth submitting?