login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2
1, 3, 78, 7338218 (list; graph; refs; listen; history; text; internal format)
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 A064456 A073176

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 12 17:33 EDT 2021. Contains 344959 sequences. (Running on oeis4.)