A300328 Triangle read by rows: row n gives the number of solutions to +-1 +- 2 +- 3 +- ... +- n == k (mod n).
2, 0, 4, 4, 2, 2, 8, 0, 8, 0, 8, 6, 6, 6, 6, 0, 20, 0, 24, 0, 20, 20, 18, 18, 18, 18, 18, 18, 64, 0, 64, 0, 64, 0, 64, 0, 60, 56, 56, 58, 56, 56, 58, 56, 56, 0, 204, 0, 204, 0, 208, 0, 204, 0, 204, 188, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186
Offset: 1
Examples
First few rows are: 2; 0, 4; 4, 2, 2; 8, 0, 8, 0; 8, 6, 6, 6, 6; 0, 20, 0, 24, 0, 20; 20, 18, 18, 18, 18, 18, 18; 64, 0, 64, 0, 64, 0, 64, 0;
Links
- Seiichi Manyama, Rows n = 1..140, flattened