A300324 Triangle read by rows: row n gives the number of solutions to +-1 +- 3 +- 6 +- ... +- n*(n+1)/2 == k (mod n).
2, 4, 0, 0, 4, 4, 8, 0, 8, 0, 8, 4, 8, 8, 4, 32, 0, 16, 0, 16, 0, 24, 24, 16, 12, 12, 16, 24, 64, 0, 64, 0, 64, 0, 64, 0, 40, 72, 60, 44, 60, 60, 44, 60, 72, 224, 0, 208, 0, 192, 0, 192, 0, 208, 0, 176, 188, 188, 180, 196, 184, 184, 196, 180, 188, 188
Offset: 1
Examples
First few rows are: 2; 4, 0; 0, 4, 4; 8, 0, 8, 0; 8, 4, 8, 8, 4; 32, 0, 16, 0, 16, 0; 24, 24, 16, 12, 12, 16, 24; 64, 0, 64, 0, 64, 0, 64, 0;
Links
- Seiichi Manyama, Rows n = 1..140, flattened