cp's OEIS Frontend

A206871 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 0 1 vertically.

%I A206871 #7 Jul 22 2025 19:45:23
%S A206871 2,4,4,7,16,7,13,49,49,12,24,169,211,144,21,44,576,1153,889,441,37,81,
%T A206871 1936,6139,7675,3967,1369,65,149,6561,31529,63866,55063,17737,4225,
%U A206871 114,274,22201,165783,502864,728935,397221,78799,12996,200,504,75076,867545
%N A206871 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 0 1 vertically.
%C A206871 Table starts
%C A206871 ...2.....4......7.......13.........24..........44............81.............149
%C A206871 ...4....16.....49......169........576........1936..........6561...........22201
%C A206871 ...7....49....211.....1153.......6139.......31529........165783..........867545
%C A206871 ..12...144....889.....7675......63866......502864.......4108471........33311703
%C A206871 ..21...441...3967....55063.....728935.....8942469.....115505069......1476136671
%C A206871 ..37..1369..17737...397221....8373905...159327093....3254925997.....65503023421
%C A206871 ..65..4225..78799..2841311...95207761..2805723059...90497940567...2863087460903
%C A206871 .114.12996.350017.20294131.1080443638.49382253588.2513905109615.125050630010443
%H A206871 R. H. Hardin, <a href="/A206871/b206871.txt">Table of n, a(n) for n = 1..312</a>
%e A206871 Some solutions for n=4 k=3
%e A206871 ..1..1..0....1..1..0....1..0..0....0..0..1....0..1..0....1..1..1....0..0..1
%e A206871 ..0..0..1....0..0..1....0..0..1....0..0..1....1..0..1....1..1..0....0..0..1
%e A206871 ..0..0..1....0..0..1....0..0..1....1..1..1....0..0..1....1..0..0....0..0..1
%e A206871 ..1..0..0....0..1..1....0..1..1....0..0..1....0..1..0....1..0..1....1..1..1
%Y A206871 Column 1 is A005251(n+3)
%Y A206871 Column 2 is A188501
%Y A206871 Row 1 is A000073(n+3)
%Y A206871 Row 2 is A085697(n+1)
%K A206871 nonn,tabl
%O A206871 1,1
%A A206871 _R. H. Hardin_ Feb 13 2012