|
%I #5 May 28 2021 13:39:46
%S 0,1,1,1,3,1,2,11,11,2,3,34,63,34,3,5,111,390,390,111,5,8,361,2385,
%T 4475,2385,361,8,13,1172,14621,52186,52186,14621,1172,13,21,3809,
%U 89602,606546,1154119,606546,89602,3809,21,34,12377,549125,7053923,25448809,25448809
%N T(n,k) = half the number of n X k binary arrays with each element equal to at least one neighbor.
%C Table starts
%C ..0.....1........1...........2.............3................5
%C ..1.....3.......11..........34...........111..............361
%C ..1....11.......63.........390..........2385............14621
%C ..2....34......390........4475.........52186...........606546
%C ..3...111.....2385.......52186.......1154119.........25448809
%C ..5...361....14621......606546......25448809.......1064583557
%C ..8..1172....89602.....7053923.....561487456......44560487654
%C .13..3809...549125....82032712...12387396391....1865051797753
%C .21.12377..3365327...953982820..273289411333...78060898850787
%C .34.40218.20624430.11094190209.6029284136868.3267207111743056
%H R. H. Hardin, <a href="/A180771/b180771.txt">Table of n, a(n) for n=1..264</a>
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Sep 20 2010
|
