|
| |
|
|
A051597
|
|
Rows of triangle formed using Pascal's rule except begin and end n-th row with n+1.
|
|
6
| |
|
|
1, 2, 2, 3, 4, 3, 4, 7, 7, 4, 5, 11, 14, 11, 5, 6, 16, 25, 25, 16, 6, 7, 22, 41, 50, 41, 22, 7, 8, 29, 63, 91, 91, 63, 29, 8, 9, 37, 92, 154, 182, 154, 92, 37, 9, 10, 46, 129, 246, 336, 336, 246, 129, 46, 10, 11, 56, 175, 375, 582, 672, 582, 375, 175, 56, 11
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| The number of spotlight tilings of an (m+1) X (n+1) rectangle, read by antidiagonals. - Bridget Eileen Tenner (bridget(AT)math.depaul.edu), Nov 09 2007
|
|
|
LINKS
| B. E. Tenner, Spotlight tiling, Ann. Combin. 14 (4) (2010) 553.
|
|
|
FORMULA
| T(2n,n)=A051924(n+1) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 26 2006
T(m,n) = binomial(m+n,m) - binomial(m+n-2,m-1). - Bridget Eileen Tenner (bridget(AT)math.depaul.edu), correct up to offset and transformation of square indices to triangular indices. Nov 09 2007
|
|
|
EXAMPLE
| 1;
2,2;
3,4,3;
4,7,7,4;
5,11,14,11,5;
|
|
|
CROSSREFS
| Row sums give A033484(n). Stripped variant of A072405, A122218.
Sequence in context: A131923 A119457 A065157 * A084193 A049787 A084192
Adjacent sequences: A051594 A051595 A051596 * A051598 A051599 A051600
|
|
|
KEYWORD
| easy,nonn,tabl
|
|
|
AUTHOR
| Asher Auel (asher.auel(AT)reed.edu)
|
| |
|
|
