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.

1, 3, 78, 7338218

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

Table of n, a(n) for n=1..4.

Andrew Weimholt, 3D solutions in numerical representation

Andrew Weimholt, Notes on reading the 3D solutions

Example

For n=2 the three figures are: the four edges of a square, or omit one edge, or omit two adjacent edges.

Crossrefs

Cf. A222186.

Sequence in context: A306818 A092416 A069839 * A236069 A364947 A064456

Adjacent sequences: A222189 A222190 A222191 * A222193 A222194 A222195

Keyword

nonn,more

Author

Andrew Weimholt, Feb 12 2013

Extensions

a(4) computed by Andrew Weimholt, Feb 13 2013

Status

approved