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.
%I A273096 #23 Jun 27 2023 15:07:49 %S A273096 1,0,1,1,0,1,1,3,3,4,6,18,69 %N A273096 Number of rotationally inequivalent minimal relations of roots of unity of weight n. %C A273096 In this context, a relation of weight n is a multiset of n roots of unity which sum to zero, and it is minimal if no proper nonempty sub-multiset sums to zero. Relations are rotationally equivalent if they are obtained by multiplying each element by a common root of unity. %C A273096 Mann classified the minimal relations up to weight 7, Conway and Jones up to weight 9, and Poonen and Rubinstein up to weight 12. %H A273096 J. H. Conway and A. J. Jones, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa30/aa3033.pdf">Trigonometric diophantine equations (On vanishing sums of roots of unity)</a>, Acta Arithmetica 30(3), 229-240 (1976). %H A273096 Henry B. Mann, <a href="http://dx.doi.org/10.1112/S0025579300005210">On linear relations between roots of unity</a>, Mathematika 12(2), 107-117 (1965). %H A273096 Bjorn Poonen and Michael Rubinstein, <a href="http://dx.doi.org/10.1137/S0895480195281246">The Number of Intersection Points Made by the Diagonals of a Regular Polygon</a>, SIAM J. Discrete Math. 11(1), 135-156 (1998). Also at <a href="http://arxiv.org/abs/math.MG/9508209">arXiv:math/9508209 [math.MG]</a> with some typos corrected. %e A273096 Writing e(x) = exp(2*Pi*i*x), then e(1/6)+e(1/5)+e(2/5)+e(3/5)+e(4/5)+e(5/6) = 0 and this is the unique (up to rotation) minimal relation of weight 6. %Y A273096 Cf. A103314, A110981, A164896. %K A273096 nonn,more %O A273096 0,8 %A A273096 _Christopher E. Thompson_, May 15 2016