login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #17 Feb 14 2013 14:01:17

%S 1,3,78,7338218

%N 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.

%C "Inequivalent" means that figures differing by a rotation and/or reflection are not regarded as different.

%C "Fully n-dimensional" means not lying in a proper subspace.

%C This is a variation on A222186, that was based on a work by the artist Sol LeWitt.

%H Andrew Weimholt, <a href="/A222192/a222192.dat.txt">3D solutions in numerical representation</a>

%H Andrew Weimholt, <a href="/A222192/a222192_1.dat.txt">Notes on reading the 3D solutions</a>

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

%Y Cf. A222186.

%K nonn,more

%O 1,2

%A _Andrew Weimholt_, Feb 12 2013

%E a(4) computed by _Andrew Weimholt_, Feb 13 2013