%I
%S 1,2,1,6,3,2,32,21,18,9,354,257,219,159,75,8520,6203,5203,4166,2985,
%T 1355
%N Triangle read by rows: T(n,k) = number of fully connected (n,k) corner designs (n >= 0, 1 <= k <= n+1).
%H Craig S. Kaplan, <a href="http://archive.bridgesmathart.org/2013/bridges2013317.pdf">Gridbased decorative corners</a>, in Proceedings of Bridges 2013: Mathematics, Music, Art, ..., 2013, pp. 317324.
%H Craig S. Kaplan, <a href="/A232467/a232467.pdf">Illustrations of corner designs</a> (some slides from Bridges 2013 talk  see above link for full article)
%e Triangle begins:
%e 1
%e 2 1
%e 6 3 2
%e 32 21 18 9
%e 354 257 219 159 75
%e 8520 6203 5203 4166 2985 1355
%e ...
%Y Cf. A232468, A232469, A232470, A232471.
%K nonn,tabl,nice,more
%O 0,2
%A _N. J. A. Sloane_, Nov 24 2013
