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.

A174856 Square array read by antidiagonals up. Redheffer type matrix. T(1,1)=1 and T(n,1) = A049240.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 1

Views

Author

Mats Granvik, Mar 31 2010

Keywords

Comments

The first column is equal to 0 when n is a square greater than 1. The rest of the array is equal to A143104. The determinant of this array is A002819.

Examples

			The array begins:
  1,1,1,1,1,1,1,1,1,1
  1,1,0,0,0,0,0,0,0,0
  1,0,1,0,0,0,0,0,0,0
  0,1,0,1,0,0,0,0,0,0
  1,0,0,0,1,0,0,0,0,0
  1,1,1,0,0,1,0,0,0,0
  1,0,0,0,0,0,1,0,0,0
  1,1,0,1,0,0,0,1,0,0
  0,0,1,0,0,0,0,0,1,0
  1,1,0,0,1,0,0,0,0,1
		

Crossrefs

Programs

  • Mathematica
    t[1, 1] = 1; t[n_, 1] := Boole[!IntegerQ[Sqrt[n]]]; t[n_, k_] := Boole[n == 1 || Mod[n, k] == 0]; Table[t[n - k + 1, k], {n, 1, 14}, {k, 1, n}] // Flatten (* Jean-François Alcover, Dec 05 2013 *)