|
%I #21 Jan 15 2020 07:45:09
%S 1,0,1,1,1,1,0,0,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,
%T 0,1,1,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,1,1,0,0,
%U 0,1,0,0,0,1,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,1,0,1,0,0,1,1,0,0,1,1,0,1,0,1
%N Triangle read by rows: abs(A103447)*A047999 mod 2.
%C Row sums are A105595.
%H Robert Israel, <a href="/A105594/b105594.txt">Table of n, a(n) for n = 0..10010</a> (rows 0 to 140, flattened)
%F T(n, k) = mod(Sum_{j=0..n}(abs(mu(binomial(n,j)))*mod(binomial(j,k),2)), 2).
%e Triangle starts
%e 1;
%e 0,1;
%e 1,1,1;
%e 0,0,0,1;
%e 1,0,1,0,1;
%e 0,1,0,1,0,1;
%e 0,0,0,0,1,1,1;
%p A105594 := proc(n,k)
%p add( abs(numtheory[mobius](binomial(n,j)))*modp(binomial(j,k),2) ,j=0..n) ;
%p % mod 2 ;
%p end proc: # _R. J. Mathar_, Nov 28 2014
%t T[n_, k_] := Sum[Abs[MoebiusMu[Binomial[n, j]]*Mod[Binomial[j, k], 2]], {j, 0, n}] // Mod[#, 2]&;
%t Table[T[n, k], {n, 0, 13}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Jan 15 2020 *)
%Y Cf. A047999, A103447, A105595, A105596.
%K easy,nonn,tabl
%O 0,1
%A _Paul Barry_, Apr 14 2005
|
