|
%I #5 Mar 31 2012 12:37:07
%S 30,111,111,423,630,423,1611,3642,3642,1611,6132,21126,32106,21126,
%T 6132,23340,122526,284910,284910,122526,23340,88839,710526,2531223,
%U 3875376,2531223,710526,88839,338148,4120230,22488006,52826862,52826862,22488006
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two
%C Table starts
%C .....30......111........423.........1611...........6132...........23340
%C ....111......630.......3642........21126.........122526..........710526
%C ....423.....3642......32106.......284910........2531223........22488006
%C ...1611....21126.....284910......3875376.......52826862.......720376872
%C ...6132...122526....2531223.....52826862.....1105752330.....23163320754
%C ..23340...710526...22488006....720376872....23163320754....745699860222
%C ..88839..4120230..199775148...9823579164...485313697782..24015926216514
%C .338148.23892558.1774684842.133958429916.10168541874792.773556773975484
%H R. H. Hardin, <a href="/A205836/b205836.txt">Table of n, a(n) for n = 1..264</a>
%e Some solutions for n=4 k=3
%e ..1..1..0..1....2..0..0..1....1..2..1..2....0..0..1..0....1..1..0..2
%e ..0..2..1..2....1..2..1..2....2..1..2..0....2..1..2..1....0..2..1..0
%e ..1..0..2..1....2..1..0..1....0..2..0..1....1..2..0..2....2..1..2..1
%e ..2..1..0..2....1..0..1..2....2..1..2..0....1..0..1..0....1..0..0..2
%e ..0..2..1..0....0..1..0..0....1..2..0..2....2..1..2..1....0..2..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 01 2012
| 