0,4

The number of spotlight tilings of an m-by-n rectangle missing the southeast corner. E.g. there are 2 spotlight tilings of a 2 X 2 square missing its southeast corner. - Bridget Eileen Tenner (bridget(AT)math.depaul.edu), Nov 10 2007

B. E. Tenner, Spotlight tiling, preprint, 2007.

T(m,n) = binom{m+n}{m} - 2*binom{m+n-2}{m-1} - Bridget Eileen Tenner (bridget(AT)math.depaul.edu), Nov 10 2007

t(n,k)= Binomial[n, k + 1] + Binomial[n, n - k + 1]. [From Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 17 2009]

Contribution from Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 17 2009: (Start)

{0},

{1, 1},

{2, 2, 2},

{3, 4, 4, 3},

{4, 7, 8, 7, 4},

{5, 11, 15, 15, 11, 5},

{6, 16, 26, 30, 26, 16, 6},

{7, 22, 42, 56, 56, 42, 22, 7},

{8, 29, 64, 98, 112, 98, 64, 29, 8},

{9, 37, 93, 162, 210, 210, 162, 93, 37, 9},

{10, 46, 130, 255, 372, 420, 372, 255, 130, 46, 10},

{11, 56, 176, 385, 627, 792, 792, 627, 385, 176, 56, 11},

{12, 67, 232, 561, 1012, 1419, 1584, 1419, 1012, 561, 232, 67, 12} (End)

Contribution from Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 17 2009: (Start)

t[n_, k_] = Binomial[n, k + 1] + Binomial[n, n - k + 1];

Table[Table[t[n, k], {k, 0, n}], {n, 0, 12}];

Flatten[%] (End)

Row sums give A000918(n+1).

Sequence in context: A096009 A000224 A085201 this_sequence A054225 A074829 A060243

Adjacent sequences: A051598 A051599 A051600 this_sequence A051602 A051603 A051604

easy,nonn,tabl

Asher Auel (asher.auel(AT)reed.edu)