|
| |
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Table of n, a(n) for n=0..20.
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
|
Cf. A232468, A232469, A232470, A232471.
Sequence in context: A094310 A165908 A121281 * A131449 A289869 A334595
Adjacent sequences: A232464 A232465 A232466 * A232468 A232469 A232470
|
|
|
KEYWORD
|
nonn,tabl,nice,more
|
|
|
AUTHOR
|
N. J. A. Sloane, Nov 24 2013
|
|
|
STATUS
|
approved
|
| |
|
|
