|
%I #16 Mar 10 2015 06:46:30
%S 1,1,1,1,3,1,1,1,1,1,1,3,5,3,1,1,7,15,15,7,1,1,5,1,15,1,5,1,1,1,31,19,
%T 19,31,1,1,1,3,9,9,83,9,9,3,1,1,11,27,63,65,65,63,27,11,1,1,15,55,17,
%U 221,65,221,17,55,15,1,1,7,13,239,495,297,297,495,239,13,7,1
%N Triangle read by rows: binary reversed Gray code of binomial(n,m).
%C Row sums are: 1, 2, 5, 4, 13, 46, 29, 104, 127, 334, 683, 2104,...
%H Eric W. Weisstein, <a href="http://mathworld.wolfram.com/GrayCode.html">Gray code</a>
%F T(n,m) = A030101(A003188(binomial(n,m)) = A030101(A143214(n,m)). - _R. J. Mathar_, Mar 10 2015
%e 1;
%e 1, 1;
%e 1, 3, 1;
%e 1, 1, 1, 1;
%e 1, 3, 5, 3, 1;
%e 1, 7, 15, 15, 7, 1;
%e 1, 5, 1, 15, 1, 5, 1;
%e 1, 1, 31, 19, 19, 31, 1, 1;
%e 1, 3, 9, 9, 83, 9, 9, 3, 1;
%e 1, 11, 27, 63, 65, 65, 63, 27, 11, 1;
%e 1, 15, 55, 17, 221, 65, 221, 17, 55, 15, 1;
%e 1, 7, 13, 239, 495, 297, 297, 495, 239, 13, 7, 1;
%p A143261 := proc(n,m)
%p binomial(n,m) ;
%p A003188(%) ;
%p A030101(%) ;
%p end proc: # _R. J. Mathar_, Mar 10 2015
%t GrayCodeList[k_] := Module[{b = IntegerDigits[k, 2], i}, Do[ If[b[[i - 1]] == 1, b[[i]] = 1 - b[[i]]], {i, Length[b], 2, -1} ]; b ]; b = Table[Table[Sum[GrayCodeList[Binomial[n, k]][[m + 1]]*2^m, {m, 0, Length[GrayCodeList[Binomial[n, k]]] - 1}], {k, 0, n}], {n, 0, Length[a]}]; Flatten[b]
%Y Cf. A143214, A178058.
%K nonn,tabl
%O 0,5
%A _Roger L. Bagula_ and _Gary W. Adamson_, Oct 21 2008
%E Edited by _R. J. Mathar_, Mar 10 2015
|
