cp's OEIS Frontend

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

%I A206994 #9 Jul 22 2025 19:54:30
%S A206994 2,4,4,7,16,7,13,49,49,13,24,169,174,169,24,44,576,840,840,576,44,81,
%T A206994 1936,3858,6510,3858,1936,81,149,6561,17460,46878,46878,17460,6561,
%U A206994 149,274,22201,80070,329952,516724,329952,80070,22201,274,504,75076,365784
%N A206994 T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 horizontally and 1 1 1 vertically.
%C A206994 Table starts
%C A206994 ...2.....4......7.......13........24..........44...........81............149
%C A206994 ...4....16.....49......169.......576........1936.........6561..........22201
%C A206994 ...7....49....174......840......3858.......17460........80070.........365784
%C A206994 ..13...169....840.....6510.....46878......329952......2371090.......16939450
%C A206994 ..24...576...3858....46878....516724.....5517786.....60684900......661767626
%C A206994 ..44..1936..17460...329952...5517786....88819714...1482397764....24487141408
%C A206994 ..81..6561..80070..2371090..60684900..1482397764..37849652838...954576893140
%C A206994 .149.22201.365784.16939450.661767626.24487141408.954576893140.36679559167444
%H A206994 R. H. Hardin, <a href="/A206994/b206994.txt">Table of n, a(n) for n = 1..311</a>
%H A206994 Shizuo Kaji, A Derouet-Jourdan, H Ochiai, Dappled tiling, arXiv preprint arXiv:1607.06138, 2016
%e A206994 Some solutions for n=4 k=3
%e A206994 ..1..1..1....1..0..1....1..0..1....1..0..0....1..0..0....1..1..0....1..1..0
%e A206994 ..0..0..1....1..0..1....1..0..0....0..0..1....1..0..1....1..0..1....1..1..1
%e A206994 ..0..1..0....0..1..0....0..1..1....0..1..0....0..0..1....0..1..1....0..0..1
%e A206994 ..1..0..1....0..1..0....0..0..1....0..0..1....1..0..0....1..1..0....1..1..0
%Y A206994 Column 1 is A000073(n+3)
%Y A206994 Column 2 is A085697(n+1)
%K A206994 nonn,tabl
%O A206994 1,1
%A A206994 _R. H. Hardin_ Feb 14 2012