Number of ways prime(n) is a sum of 3 odd nonprimes r,s,t satisfying 1 <= r < s < t.

A024680

Number of ways prime(n) is a sum of 3 odd nonprimes r,s,t satisfying 1 <= r < s < t.

Terms

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

External references