This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A354010 #14 May 18 2022 17:40:39
%S A354010 1,1,0,1,1,3,1,0,7,8,1,1,17,81,702,1,0,41,184,4623,41952,1,1,99,1051,
%T A354010 35044,654673,16600824,1,0,239,3176,248045,7407376,358635313,
%U A354010 13298557992,1,1,577,14609,1819731,100694199,8448412164,569631442289,43157780553934
%N A354010 Triangle read by rows: T(k,n) (k >= 0, n = 0, ..., k) = number of tilings of a k X n rectangle using 2 X 2 tiles, right trominoes and dominoes.
%C A354010 For tiling algorithm, see A351322.
%C A354010 Reading the sequence {T(k,n)}, use T(n,k) instead of T(k,n) for n>k.
%C A354010 T(1,n) = A000035(n+1) = (n+1) mod 2,
%C A354010 T(2,n) = A001333(n), T(3,n) = A354011(n), T(4,n) = A354012(n).
%e A354010 Triangle begins
%e A354010 k\n 0 1 2 3 4 5 6
%e A354010 -----------------------------------------
%e A354010 0 1
%e A354010 1 1 0
%e A354010 2 1 1 3
%e A354010 3 1 0 7 8
%e A354010 4 1 1 17 81 702
%e A354010 5 1 0 41 184 4623 41952
%e A354010 6 1 1 99 1051 35044 654673 16600824
%o A354010 (Maxima) See A352589.
%Y A354010 Cf. A000035, A001333, A351322, A352589, A354011, A354012.
%Y A354010 T(n,n) gives A354119.
%K A354010 nonn,tabl
%O A354010 0,6
%A A354010 _Gerhard Kirchner_, May 14 2022