login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A300324
Triangle read by rows: row n gives the number of solutions to +-1 +- 3 +- 6 +- ... +- n*(n+1)/2 == k (mod n).
2
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,1
LINKS
EXAMPLE
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;
CROSSREFS
Cf. A000079 (row sums), A300307, A300328.
Sequence in context: A263788 A355335 A292144 * A298368 A072069 A230423
KEYWORD
nonn,tabl
AUTHOR
Seiichi Manyama, Mar 02 2018
STATUS
approved