|
| |
|
|
A222186
|
|
a(n) = number of distinct 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.
|
|
2
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
"Distinct" means that figures differing by a rotation are not regarded as different.
"Fully n-dimensional" means not lying in a proper subspace.
Suggested by Sol LeWitt's work "Variations of Incomplete Open Cubes," which shows 122 of the 123 figures in the three-dimensional case.
|
|
|
REFERENCES
|
Peter Schjeldahl, Less is beautiful, The Art World, The New Yorker, March 13, 2000, pp. 98-99.
|
|
|
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,bref,more
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
