%I #14 May 13 2017 23:55:37
%S -1,-1,0,-1,1,0,-1,1,0,0,0,-1,1,1,0,0,0,0,-1,1,1,0,0,-1,0,0,0,0,0,-1,
%T 1,1,0,1,-1,0,0,0,0,0,0,0,0,0,-1,1,1,0,1,-1,0,0,-1,0,0,0,0,0,0,0,0,0,
%U 0,0,0,0,-1,1,1,0,1,-1,0,1,-1,0,0,0,0,-1,0,0,0,0
%N Möbius (or Moebius) partition function of partitions in graded reverse lexicographic ordering.
%F The Möbius partition function muP(p) of a partition p is defined by: muP(p) = (-1)^k if p has k distinct parts; otherwise muP(p) = 0 (p is a partition in graded reverse lexicographic ordering).
%e -1,
%e -1, 0,
%e -1, 1, 0,
%e -1, 1, 0, 0, 0,
%e -1, 1, 1, 0, 0, 0, 0,
%e -1, 1, 1, 0, 0, -1, 0, 0, 0, 0, 0,
%e -1, 1, 1, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
%e ...
%e Row 7 for partitions of 7 in the mentioned order: 7, 61, 52, 511, 43, 421, 4111, 331, 322, 3211, 31111, 2221, 22111, 211111, 1111111 with Möbius partition function.
%Y See A286349 for the Abramowitz-Stegun order.
%Y Cf. A080577.
%K sign
%O 1
%A _Seiichi Manyama_, May 13 2017