|
%I #15 Nov 21 2018 02:31:26
%S 1,3,2,7,6,4,15,14,12,8,31,30,28,24,16,63,62,60,56,48,32,127,126,124,
%T 120,112,96,64,255,254,252,248,240,224,192,128,511,510,508,504,496,
%U 480,448,384,256
%N Triangle of differences between powers of 2, read by rows.
%C A130321 * A059268 as infinite lower triangular matrices.
%C Row sums = A000337: (1, 5, 17, 49, 129, 321, ...). A130329 = A059268 * A130321.
%C From _Alonso del Arte_, Mar 13 2008: (Start)
%C Column 0 contains the Mersenne numbers A000225.
%C Column 1 is A000918.
%C An even perfect number (A000396) is found in the triangle by reference to its matching exponent for the Mersenne prime p (A000043) thus: go to row 2p - 1 and then column p - 1 (remembering that the first position is column 0).
%C Likewise divisors of multiply perfect numbers, if not the multiply perfect numbers themselves, can also be found in this triangle. (End)
%F t(n, k) = 2^n - 2^k, where n is the row number and k is the column number, running from 0 to n - 1. (If k is allowed to reach n, then the triangle would have an extra diagonal filled with zeros) - _Alonso del Arte_, Mar 13 2008
%e First few rows of the triangle are;
%e 1;
%e 3, 2;
%e 7, 6, 4;
%e 15, 14, 12, 8;
%e 31, 30, 28, 24, 16;
%e 63, 62, 60, 56, 48, 32;
%e ...
%e a(5, 2) = 28 because 2^5 = 32, 2^2 = 4 and 32 - 4 = 28.
%t ColumnForm[Table[2^n - 2^k, {n, 15}, {k, 0, n - 1}], Center] (* _Alonso del Arte_, Mar 13 2008 *)
%Y Cf. A130321, A059268, A000337, A130329.
%K nonn,tabl
%O 0,2
%A _Gary W. Adamson_, May 24 2007
%E Better definition from _Alonso del Arte_, Mar 13 2008
|
