cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A300328 Triangle read by rows: row n gives the number of solutions to +-1 +- 2 +- 3 +- ... +- n == k (mod n).

Original entry on oeis.org

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

Views

Author

Seiichi Manyama, Mar 03 2018

Keywords

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;
		

Crossrefs

Cf. A000079 (row sums), A300190, A300324, A300329.