cp's OEIS Frontend

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

%I A206936 #7 Jul 22 2025 19:49:09
%S A206936 2,4,4,7,16,7,13,49,49,12,24,169,211,144,20,44,576,1153,811,400,33,81,
%T A206936 1936,6139,6837,2791,1089,54,149,6561,31529,55088,35277,9055,2916,88,
%U A206936 274,22201,165783,410000,418876,170409,28081,7744,143,504,75076,867545
%N A206936 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 0 1 1 vertically.
%C A206936 Table starts
%C A206936 ..2....4.....7......13........24.........44..........81...........149
%C A206936 ..4...16....49.....169.......576.......1936........6561.........22201
%C A206936 ..7...49...211....1153......6139......31529......165783........867545
%C A206936 .12..144...811....6837.....55088.....410000.....3227589......25102409
%C A206936 .20..400..2791...35277....418876....4293648....48992069.....546661165
%C A206936 .33.1089..9055..170409...2967939...40316253...659747611...10405676997
%C A206936 .54.2916.28081..783557..20054092..348614952..8138711727..180107729045
%C A206936 .88.7744.84403.3498981.132811808.2858059128.95444167901.2968348851593
%H A206936 R. H. Hardin, <a href="/A206936/b206936.txt">Table of n, a(n) for n = 1..312</a>
%e A206936 Some solutions for n=4 k=3
%e A206936 ..0..0..1....1..1..1....0..1..1....1..1..0....0..0..1....0..0..1....0..1..0
%e A206936 ..0..1..1....1..1..0....1..1..0....0..0..1....0..0..1....0..0..1....1..0..1
%e A206936 ..0..0..1....1..0..1....0..1..1....0..1..0....0..0..1....1..0..1....0..1..0
%e A206936 ..0..1..0....1..1..0....1..0..0....0..0..1....1..1..1....0..0..1....1..0..0
%Y A206936 Column 1 is A000071(n+3)
%Y A206936 Column 2 is A188516
%Y A206936 Row 1 is A000073(n+3)
%Y A206936 Row 2 is A085697(n+1)
%Y A206936 Row 3 is A206872
%K A206936 nonn,tabl
%O A206936 1,1
%A A206936 _R. H. Hardin_ Feb 13 2012