|
|
A054527
|
|
Triangle read by rows: T(n,k) = Moebius mu(k) (n >= 1, 1 <= k <= n).
|
|
2
|
|
|
1, 1, -1, 1, -1, -1, 1, -1, -1, 0, 1, -1, -1, 0, -1, 1, -1, -1, 0, -1, 1, 1, -1, -1, 0, -1, 1, -1, 1, -1, -1, 0, -1, 1, -1, 0, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, 1, -1, -1, 0, -1, 1, -1, 0, 0, 1, -1, 0, -1, 1, -1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
M * Q as infinite lower triangular matrices; M = (1; 1, 1; 1, 1, 1; ...); Q = mu(n) in the main diagonal and the rest zeros. - Gary W. Adamson, Jan 17 2007
Terms in rows of this table appears to be the values of the minors in the first expansion of the determinant of the Redheffer matrix. - Mats Granvik, Aug 24 2008
|
|
LINKS
|
|
|
EXAMPLE
|
First few rows of the triangle:
1;
1, -1;
1, -1, -1;
1, -1, -1, 0;
1, -1, -1, 0, -1;
1, -1, -1, 0, -1, 1;
...
|
|
MATHEMATICA
|
Table[#[[1 ;; n]], {n, Length[#]}] &@ Array[MoebiusMu, 12] // Flatten (* Michael De Vlieger, Feb 05 2022 *)
|
|
PROG
|
(Haskell)
import Data.List (inits)
a054527 n k = a054527_tabl !! (n-1) !! (k-1)
a054527_row n = a054527_tabl !! (n-1)
a054527_tabl = tail $ inits a008683_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|