login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007849 Number of hyperplanes spanned by the vertices of an n-cube that cover exactly n vertices. 1

%I #6 Apr 05 2015 02:10:57

%S 2,6,8,80,2112,123648,23963648,25806963456

%N Number of hyperplanes spanned by the vertices of an n-cube that cover exactly n vertices.

%D O. Aichholzer and F. Aurenhammer, Classifying Hyperplanes in Hypercubes, 10th European Workshop on Computational Geometry, Santander, Spain, March 1994.

%H O. Aichholzer and F. Aurenhammer, <a href="http://dx.doi.org/10.1137/S089548019426348X">Classifying hyperplanes in hypercubes</a>, SIAM J. Discrete Math, Vol. 9, 1996, 225-232. DOI: 10.1137/S089548019426348X

%K nonn,hard,nice

%O 1,1

%A Oswin Aichholzer (oaich(AT)igi.tu-graz.ac.at)

%E Edited by _M. F. Hasler_, Apr 05 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)