Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.

Terms

a(0) =0a(1) =1a(2) =1a(3) =1a(4) =2a(5) =0a(6) =1a(7) =1a(8) =5a(9) =3a(10) =1a(11) =0a(12) =2a(13) =0a(14) =10a(15) =1a(16) =31a(17) =0a(18) =0a(19) =26a(20) =0a(21) =6a(22) =23a(23) =20a(24) =0a(25) =0a(26) =1a(27) =13a(28) =0a(29) =0