login
Triangle read by rows: A130321 + A059268 - A000012 as infinite lower triangular matrices, where A130321 = (1; 2,1; 4,2,1; ...), A059268 = (1; 1,2; 1,2,4; ...) and A000012 = (1; 1,1; 1,1,1; ...).
6

%I #26 Mar 04 2024 19:25:11

%S 1,2,2,4,3,4,8,5,5,8,16,9,7,9,16,32,17,11,11,17,32,64,33,19,15,19,33,

%T 64,128,65,35,23,23,35,65,128,256,129,67,39,31,39,67,129,256,512,257,

%U 131,71,47,47,71,131,257,512,1024,513,259,135,79,63,79,135,259,513,1024

%N Triangle read by rows: A130321 + A059268 - A000012 as infinite lower triangular matrices, where A130321 = (1; 2,1; 4,2,1; ...), A059268 = (1; 1,2; 1,2,4; ...) and A000012 = (1; 1,1; 1,1,1; ...).

%C Row sums = A000295: (1, 4, 11, 26, 57, 120, ...).

%C If we regard the sequence as an infinite square array read by diagonals then it has the formula U(n,k) = (2^n + 2^k)/2 - 1. This appears to coincide with the number of n X k 0..1 arrays colored with only straight tiles, and new values 0..1 introduced in row major order, i.e., no equal adjacent values form a corner. (Fill the array with 0's and 1's. There must never be 3 adjacent identical values making a corner, only same values in a straight line.) Some solutions with n = k = 4 are:

%C 0 1 0 1 0 1 0 0 0 0 0 1 0 0 1 1 0 1 0 1

%C 1 0 1 0 1 0 1 1 1 1 1 0 1 1 0 0 1 0 1 0

%C 1 0 1 0 0 1 0 0 0 0 0 1 0 0 1 1 0 1 0 1

%C 0 1 0 1 1 0 1 1 1 1 1 0 1 1 0 0 0 1 0 1

%C (Observation from _R. H. Hardin_, cf. link.) - _M. F. Hasler_ and _N. J. A. Sloane_, Feb 26 2013

%H Reinhard Zumkeller, <a href="/A131816/b131816.txt">Rows n = 0..120 of triangle, flattened</a>

%H R. H. Hardin, <a href="http://list.seqfan.eu/oldermail/seqfan/2013-February/010856.html">Post to the SeqFan list</a>, Feb 26 2013

%F T(n,m) = ((2^(m + 1) - 1) + (2^(n - m + 1) - 1))/2. - _Roger L. Bagula_, Oct 16 2008

%e First few rows of the triangle:

%e 1;

%e 2, 2;

%e 4, 3, 4;

%e 8, 5, 5, 8;

%e 16, 9, 7, 9, 16;

%e 32, 17, 11, 11, 17, 32;

%e 64, 33, 19, 15, 19, 33, 64;

%e 128, 65, 35, 23, 23, 35, 65, 128;

%e ...

%t Table[Table[((2^(m + 1) - 1) + (2^(n - m + 1) - 1))/2, {m, 0, n}], {n, 0, 10}]; Flatten[%] (* _Roger L. Bagula_, Oct 16 2008 *)

%o (Haskell)

%o a131816 n k = a131816_tabl !! n !! k

%o a131816_row n = a131816_tabl !! n

%o a131816_tabl = map (map (subtract 1)) $

%o zipWith (zipWith (+)) a130321_tabl a059268_tabl

%o -- _Reinhard Zumkeller_, Feb 27 2013

%Y Cf. A130321, A059268, A000012.

%Y Row sums give A000295(n+2).

%K nonn,tabl

%O 0,2

%A _Gary W. Adamson_, Jul 18 2007

%E Edited by _N. J. A. Sloane_, Jul 01 2008 at the suggestion of _R. J. Mathar_