Triangle read by rows: terms T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k).

A244125

Triangle read by rows: terms T(n,k) of a binomial decomposition of 2^n-1 as Sum(k=0..n)T(n,k).

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =4a(5) =-1a(6) =0a(7) =12a(8) =-9a(9) =4a(10) =0a(11) =32a(12) =-54a(13) =64a(14) =-27a(15) =0a(16) =80a(17) =-270a(18) =640a(19) =-675a(20) =256a(21) =0a(22) =192a(23) =-1215a(24) =5120a(25) =-10125a(26) =9216a(27) =-3125a(28) =0a(29) =448

External references