Counting all regular octahedrons in {0,1,...,n}^3

Details Counting all regular octahedrons in {0,1,...,n}^3 Counting all regular octahedrons in {0,1,...,n}^3

2010-07-09

arxiv.org/abs/1007.1655v1

Mathematics

Number Theory

21 pages, 3 figures

Scientific paper

In this paper we describe a procedure for calculating the number of regular octahedrons that have vertices with coordinates in the set {0,1,...,n}. As a result, we introduce a new sequence in ``The Online Encyclopedia of Integer Sequences" (A178797) and list the first one hundred terms of it. We adapt the method appeared in [11] which was used to find the number of regular tetrahedra with coordinates of their vertices in {0,1,...,n}. The idea of this calculation is based on the theoretical results obtained in [14]. A new fact proved here helps increasing the speed of all the programs used before. The procedure is put together in a series of commands written for Maple.

Affiliated with

Also associated with

No associations

Rating

Counting all regular octahedrons in {0,1,...,n}^3 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting all regular octahedrons in {0,1,...,n}^3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting all regular octahedrons in {0,1,...,n}^3 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-645731