cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A118887 Number of ways to place n objects with weights 1,2,...,n evenly spaced around the circumference of a circular disk so that the disk will exactly balance on the center point.

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 0, 0, 24, 0, 732, 0, 720, 48, 0, 0
Offset: 1

Views

Author

Hugo Pfoertner, May 03 2006

Keywords

Comments

The position of weight 1 is kept fixed at position 1. Mirror configurations are counted only once. Proposed in the seqfan mailing list by Brendan McKay, Sep 12 2005
Also number of permutations p1,p2,...,pn such that the polynomial p1 + p2*x + ... + pn*x^(n-1) has exp(2*pi*i/n) as a zero. Also number of equiangular polygons whose sides are some permutation of 1,2,3,...,n. - T. D. Noe, Sep 13 2005
No solutions exist if n is a prime power. Proved by W. Edwin Clark, Sep 14 2005
Murray Klamkin proved that solutions do exist if n is not a prime power. - Jonathan Sondow, Oct 17 2013

Examples

			The smallest n for which a solution exists is n=6 with 4 solutions:
...........Weight
......1..2..3..4..5..6
.Count...at.position
..1...1..4..5..2..3..6
..2...1..5..3..4..2..6
..3...1..6..2..4..3..5
..4...1..6..3..2..5..4
Configurations 1 is the mirror image of configuration 4, ditto for configurations 2 and 3. Therefore a(6)=2.
		

Crossrefs

Cf. A118888 (configurations with minimum imbalance), A063697 (positions of positive coefficients in cyclotomic polynomial in binary), A063699 (positions of negative coefficients in cyclotomic polynomial in binary), A326921.

Programs

  • Mathematica
    Needs["DiscreteMath`Combinatorica`"]; Table[eLst=E^(2.*Pi*I*Range[n]/n); Count[(Permutations[Range[n]]), q_List/;Chop[q.eLst]===0]/(2n), {n,10}] (* very slow for n>10 *) (* T. D. Noe, May 05 2006 *)

Formula

a(A000961(n)) = 0, a(A024619(n)) > 0. - Jonathan Sondow, Oct 17 2013

A118888 Number of ways to place n objects with weights 1,2,...,n evenly spaced around the circumference of a circular disk such that the remaining imbalance is minimized.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 2, 3, 24, 1, 732, 1, 720, 48, 144, 2
Offset: 1

Views

Author

Hugo Pfoertner, May 26 2006

Keywords

Comments

The position of weight 1 is kept fixed at position 1. Mirror configurations are counted only once. For n not a prime power, the sequence equals A118887.

Examples

			a(5)=1: The configuration minimizing the remaining imbalance with respect to the center of the circle is [1 4 3 2 5] (and its mirror image).
Examples of minimum imbalance configurations not in A118887:
a(7)=1: [1 4 7 2 3 5 6];
a(8)=2: [1 4 7 3 6 2 5 8], [1 7 4 3 6 5 2 8];
a(9)=3: [1 5 9 2 7 3 4 8 6], [1 5 9 4 2 6 7 3 8], [1 6 5 4 9 2 3 7 8];
a(11)=1: [1 8 9 5 2 6 10 7 3 4 11];
a(13)=1: [1 2 7 12 13 4 5 3 8 6 11 9 10];
a(16)=144: lexicographically earliest [1 3 5 13 16 7 10 2 14 4 6 9 12 8 11 15];
a(17)=2: [1 7 3 17 10 9 15 2 14 6 5 4 16 8 13 12 11],
[1 8 9 3 16 4 12 13 14 2 10 5 6 7 17 11 15] and their mirror configurations (e.g. [1 11 12 13 8 ...]) both produce a center of gravity with distance 2.1884*10^(-7) from the center of a circle with radius 1. All other configurations produce greater distances, e.g. [1 3 11 16 9 5 7 12 14 4 10 8 2 15 13 6 17] -> 2.5126*10^(-7). - _Hugo Pfoertner_, Oct 24 2019
		

Crossrefs

Extensions

a(17) corrected by Hugo Pfoertner, Oct 24 2019
Showing 1-2 of 2 results.