Smallest prime q such that sum(i=1..n-1, q mod(prime(i))) == q mod prime(n).

A216150

Smallest prime q such that sum(i=1..n-1, q mod(prime(i))) == q mod prime(n).

Terms

    a(0) =7a(1) =2a(2) =11a(3) =71a(4) =331a(5) =13a(6) =4217a(7) =4643a(8) =16381a(9) =6007a(10) =225217a(11) =260339a(12) =4772483a(13) =117351431a(14) =130554581a(15) =2499413753

External references