%I #4 Dec 16 2012 05:51:08
%S 1,2,1,3,5,1,5,14,13,1,8,47,64,34,1,13,149,430,292,89,1,21,481,2604,
%T 3966,1332,233,1,34,1544,16310,45966,36640,6076,610,1,55,4965,101052,
%U 561636,810778,338581,27716,1597,1,89,15957,628269,6743873,19333688,14298089
%N T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly one horizontal or antidiagonal neighbor
%C Table starts
%C .1.....2........3............5...............8..................13
%C .1.....5.......14...........47.............149.................481
%C .1....13.......64..........430............2604...............16310
%C .1....34......292.........3966...........45966..............561636
%C .1....89.....1332........36640..........810778............19333688
%C .1...233.....6076.......338581........14298089...........665748170
%C .1...610....27716......3128843.......252139015.........22926570957
%C .1..1597...126428.....28913910......4446314533........789539775889
%C .1..4181...576708....267196106.....78407942556......27190037181789
%C .1.10946..2630684...2469184016...1382674335890.....936366170726784
%C .1.28657.12000004..22817958901..24382584703194...32246430390993213
%C .1.75025.54738652.210862878471.429971411669361.1110497486239608510
%H R. H. Hardin, <a href="/A220562/b220562.txt">Table of n, a(n) for n = 1..337</a>
%e Some solutions for n=3 k=4 0=self 3=ne 4=w 6=e 7=sw (reciprocal directions total 10)
%e ..0..0..0..0....0..6..4..0....0..7..6..4....0..7..6..4....6..4..0..0
%e ..0..7..6..4....6..4..7..0....3..0..0..0....3..0..0..7....6..4..7..7
%e ..3..6..4..0....0..3..0..0....0..0..0..0....0..0..3..0....0..3..3..0
%Y Column 2 is A001519(n+1)
%Y Column 3 is A060801
%Y Row 1 is A000045(n+1)
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_ Dec 16 2012