Number of distinct solutions to x + y + z = 0 (mod n), where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z.

A048259

Number of distinct solutions to x + y + z = 0 (mod n), where two solutions are equivalent if one can be obtained from the other by multiplying by units in Z/nZ and permuting x,y,z.

Terms

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

External references