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.

Showing 1-1 of 1 results.

A327785 Square array read by antidiagonals: A(n,k) = Sum_{d|n} (k/d), (n>=1, k>=0), where (m/n) is the Kronecker symbol.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 0, 2, 1, 0, 4, 1, 1, 1, 0, 1, 0, 0, 2, 1, 1, 2, 1, 1, 2, 0, 2, 4, 1, 1, 1, 2, 1, 1, 2, 0, 1, 3, 1, 1, 2, 0, 3, 2, 0, 2, 0, 1, 4, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 2, 3, 0, 4, 0, 0, 3, 0, 0, 6, 1
Offset: 1

Views

Author

Seiichi Manyama, Sep 25 2019

Keywords

Examples

			Square array begins:
   1, 1, 1, 1, 1, 1, 1, 1, ...
   1, 2, 1, 0, 1, 0, 1, 2, ...
   1, 2, 0, 1, 2, 0, 1, 2, ...
   1, 3, 1, 1, 1, 1, 1, 3, ...
   1, 2, 0, 0, 2, 1, 2, 0, ...
   1, 4, 0, 0, 2, 0, 1, 4, ...
   1, 2, 2, 0, 2, 0, 0, 1, ...
   1, 4, 1, 0, 1, 0, 1, 4, ...
		

Crossrefs

Programs

  • Mathematica
    A[n_, k_] := Sum[KroneckerSymbol[k, d], {d, Divisors[n]}];
    Table[A[n - k, k], {n, 1, 13}, {k, n - 1, 0, -1}] // Flatten (* Jean-François Alcover, Sep 25 2019 *)
Showing 1-1 of 1 results.