|
Search: id:A124505
|
|
|
| A124505 |
|
Number of regular n-dimensional simplices that can be inscribed on the vertices of an n-dimensional hypercube. |
|
+0
2
|
|
| 1, 1, 0, 2, 0, 0, 0, 480, 0, 0, 0, 10321920, 0, 0, 0, 64561751654400, 0, 0, 0, 1480206036768915456000, 0, 0, 0, 8898131405512141870083342336000, 0, 0, 0, 10827543712227210782977570287648768000000, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
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).
|
|
LINKS
|
Andrew Weimholt, Further comments
|
|
EXAMPLE
|
a(3) = 2 because two regular tetrahedra can be inscribed on the vertices of a cube.
|
|
CROSSREFS
|
See A108973 for another version.
Sequence in context: A118887 A057383 A086260 this_sequence A025444 A092575 A065335
Adjacent sequences: A124502 A124503 A124504 this_sequence A124506 A124507 A124508
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Andrew Weimholt (andrew(AT)weimholt.com), Dec 20 2006, Dec 26 2006
|
|
|
Search completed in 0.002 seconds
|
