|
%I #4 Aug 10 2015 00:38:28
%S 1,0,-1,0,-1,0,0,-1,1,0,0,-1,0,0,0,0,-1,2,0,0,0,0,-1,0,0,0,0,0,0,-1,2,
%T -1,0,0,0,0,0,-1,1,0,0,0,0,0,0,0,-1,2,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,
%U 0,0,0,0,-1,4,-3,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,0,0,0,0,0,-1,2,0,0,0
%N Triangle T(n,k) read by rows. Each column is the Mobius function "recurrence" with the previous column as input.
%C The title says "recurrence" in quotes because the Mobius function does not have a regular recurrence. Row sums are A008683. Number of nonzero elements in the rows are A086436 which is essentially the same as A001222. Each row is a row in a Pascal like triangle.
%e Table begins:
%e 1,
%e 0,-1,
%e 0,-1,0,
%e 0,-1,1,0,
%e 0,-1,0,0,0,
%e 0,-1,2,0,0,0,
%e 0,-1,0,0,0,0,0,
%e 0,-1,2,-1,0,0,0,0,
%e 0,-1,1,0,0,0,0,0,0,
%e 0,-1,2,0,0,0,0,0,0,0,
%Y Cf. A008683, A086436, A001222.
%K sign,tabl
%O 1,18
%A _Mats Granvik_, May 27 2010
|
