Let q(n) = prime(1) + ... + prime(n); a(n) = smallest divisor of q(n) not already in sequence.

Terms

a(0) =1a(1) =5a(2) =2a(3) =17a(4) =4a(5) =41a(6) =29a(7) =7a(8) =10a(9) =3a(10) =8a(11) =197a(12) =14a(13) =281a(14) =82a(15) =127a(16) =11a(17) =167a(18) =71a(19) =9a(20) =89a(21) =113a(22) =19a(23) =107a(24) =20a(25) =27a(26) =16a(27) =457a(28) =37a(29) =59