|
|
A222192
|
|
a(n) = number of inequivalent ways to choose a subset of the n*2^(n-1) edges of the n-cube so that the resulting figure is connected and fully n-dimensional.
|
|
3
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
"Inequivalent" means that figures differing by a rotation and/or reflection are not regarded as different.
"Fully n-dimensional" means not lying in a proper subspace.
This is a variation on A222186, that was based on a work by the artist Sol LeWitt.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=2 the three figures are: the four edges of a square, or omit one edge, or omit two adjacent edges.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|