Number of subsets of 9 integers between 1 and n such that their sum is 3 modulo n.

Terms

a(0) =1a(1) =5a(2) =19a(3) =55a(4) =143a(5) =335a(6) =715a(7) =1430a(8) =2703a(9) =4862a(10) =8398a(11) =14000a(12) =22610a(13) =35530a(14) =54484a(15) =81719a(16) =120175a(17) =173592a(18) =246675a(19) =345345a(20) =476913a(21) =650325a(22) =876525a(23) =1168710a(24) =1542684a(25) =2017356a(26) =2615103a(27) =3362260a(28) =4289780a(29) =5433736