Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A232467
Triangle read by rows: T(n,k) = number of fully connected (n,k) corner designs (n >= 0, 1 <= k <= n+1).
5
1, 2, 1, 6, 3, 2, 32, 21, 18, 9, 354, 257, 219, 159, 75, 8520, 6203, 5203, 4166, 2985, 1355
OFFSET
0,2
LINKS
Craig S. Kaplan, Grid-based decorative corners, in Proceedings of Bridges 2013: Mathematics, Music, Art, ..., 2013, pp. 317-324.
Craig S. Kaplan, Illustrations of corner designs (some slides from Bridges 2013 talk - see above link for full article).
EXAMPLE
Triangle begins:
1
2 1
6 3 2
32 21 18 9
354 257 219 159 75
8520 6203 5203 4166 2985 1355
...
CROSSREFS
KEYWORD
nonn,tabl,nice,more
AUTHOR
N. J. A. Sloane, Nov 24 2013
STATUS
approved