|
|
A300124
|
|
Number of ways to tile the diagram of an integer partition of n using connected skew partitions.
|
|
6
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The diagram of a connected skew partition is required to be connected as a polyomino but can have empty rows or columns.
|
|
LINKS
|
Table of n, a(n) for n=1..8.
Solomon W. Golomb, Tiling with polyominoes, Journal of Combinatorial Theory, 1-2 (1966), 280-296.
Gus Wiseman, Connected tilings n = 1..4.
Gus Wiseman, Connected tilings n = 5.
Gus Wiseman, Connected tilings n = 6.
|
|
CROSSREFS
|
Cf. A000085, A000898, A006958, A138178, A259479, A259480, A296561, A297388, A299926, A300120, A300122, A300123.
Sequence in context: A242471 A239800 A237501 * A343517 A308371 A052303
Adjacent sequences: A300121 A300122 A300123 * A300125 A300126 A300127
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Gus Wiseman, Feb 25 2018
|
|
STATUS
|
approved
|
|
|
|