|
|
|
|
1, 1, -2, 1, 0, -3, 1, -2, 0, 0, 1, 0, 0, 0, -5, 1, -2, -3, 0, 0, 6, 1, 0, 0, 0, 0, 0, -7, 1, -2, 0, 0, 0, 0, 0, 0, 1, 0, -3, 0, 0, 0, 0, 0, 0, 1, -2, 0, 0, -5, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -11, 1, -2, -3, 0, 0, 6, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -13, 1, -2, 0, 0, 0, 0, -7, 0, 0, 0, 0, 0, 0, 14
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Row sums = A023900: (1, -1, -2, -1, -4, 2, -6,...).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
First few rows of the triangle =
1;
1, -2;
1, 0, -3;
1, -2, 0, 0;
1, 0, 0, 0, -5;
1, -2, -3, 0, 0, 6;
1, 0, 0, 0, 0, 0, -7;
...
|
|
MAPLE
|
seq(seq(`if`(i mod j = 0, j*numtheory:-mobius(j), 0), j=1..i), i=1..20); # Robert Israel, Sep 07 2014
|
|
MATHEMATICA
|
Table[If[Divisible[n, k], k MoebiusMu[k], 0], {n, 1, 14}, {k, 1, n}] (* Jean-François Alcover, Jun 19 2019 *)
|
|
PROG
|
(Sage)
A143256_row = lambda n: [k*moebius(k) if k.divides(n) else 0 for k in (1..n)]
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|