|
%I #5 Mar 31 2012 12:37:22
%S 1,2,2,4,6,4,8,18,18,8,16,54,78,54,16,32,162,336,336,162,32,64,486,
%T 1446,2052,1446,486,64,128,1458,6222,12474,12474,6222,1458,128,256,
%U 4374,26772,75744,106488,75744,26772,4374,256,512,13122,115194,459810,906120,906120
%N T(n,k)=Number of nXk 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than one of its immediate leftward or upward neighbors
%C Table starts
%C ...1....2......4.......8.......16.........32..........64..........128
%C ...2....6.....18......54......162........486........1458.........4374
%C ...4...18.....78.....336.....1446.......6222.......26772.......115194
%C ...8...54....336....2052....12474......75744......459810......2791152
%C ..16..162...1446...12474...106488.....906120.....7702668.....65459016
%C ..32..486...6222...75744...906120...10771434...127750122...1513877040
%C ..64.1458..26772..459810..7702668..127750122..2110085532..34794255294
%C .128.4374.115194.2791152.65459016.1513877040.34794255294.797446347192
%H R. H. Hardin, <a href="/A208314/b208314.txt">Table of n, a(n) for n = 1..612</a>
%e Some solutions for n=4 k=3
%e ..0..0..1....0..1..1....0..0..1....0..0..0....0..1..1....0..0..1....0..1..0
%e ..0..1..0....0..1..0....0..1..0....0..1..1....1..0..1....0..1..0....0..0..1
%e ..0..0..1....0..1..1....0..0..1....1..0..1....0..1..0....1..0..1....1..1..0
%e ..0..1..0....0..1..0....1..1..0....0..1..0....0..1..0....0..1..0....1..0..1
%Y Column 2 is A008776(n-1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Feb 25 2012
|
