This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A222192 #17 Feb 14 2013 14:01:17 %S A222192 1,3,78,7338218 %N 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. %C A222192 "Inequivalent" means that figures differing by a rotation and/or reflection are not regarded as different. %C A222192 "Fully n-dimensional" means not lying in a proper subspace. %C A222192 This is a variation on A222186, that was based on a work by the artist Sol LeWitt. %H A222192 Andrew Weimholt, <a href="/A222192/a222192.dat.txt">3D solutions in numerical representation</a> %H A222192 Andrew Weimholt, <a href="/A222192/a222192_1.dat.txt">Notes on reading the 3D solutions</a> %e A222192 For n=2 the three figures are: the four edges of a square, or omit one edge, or omit two adjacent edges. %Y A222192 Cf. A222186. %K A222192 nonn,more %O A222192 1,2 %A A222192 _Andrew Weimholt_, Feb 12 2013 %E A222192 a(4) computed by _Andrew Weimholt_, Feb 13 2013