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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124505 Number of regular n-dimensional simplices that can be inscribed on the vertices of an n-dimensional hypercube. 1

%I

%S 1,1,0,2,0,0,0,480,0,0,0,10321920,0,0,0,64561751654400,0,0,0,

%T 1480206036768915456000,0,0,0,8898131405512141870083342336000,0,0,0,

%U 10827543712227210782977570287648768000000,0,0,0

%N Number of regular n-dimensional simplices that can be inscribed on the vertices of an n-dimensional hypercube.

%C Inscribing a k-simplex on the vertices of a k-cube is only possible when k is congruent to 3 mod 4 (excluding the trivial cases of k=0,1).

%H Andrew Weimholt, <a href="/A108973/a108973.txt">Further comments</a>

%e a(3) = 2 because two regular tetrahedra can be inscribed on the vertices of a cube.

%Y See A108973 for another version.

%K nonn

%O 0,4

%A _Andrew Weimholt_, Dec 20 2006, Dec 26 2006

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 November 27 19:48 EST 2022. Contains 358406 sequences. (Running on oeis4.)