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 A007874 #14 Aug 06 2018 05:33:23 %S A007874 1,1,1,2,4,10,24,63,177,428,1230,2556,8202,18506,18162,119069 %N A007874 Distinct perimeter lengths of polygons with regularly spaced vertices. %C A007874 For n points on a circle there are floor(n/2) distinct line segment lengths. Hence an upper bound for a(n) is the number of compositions of n into floor(n/2) nonnegative parts, which is A127040(n-2). To find a(n), the length of A052558(n-2) paths must be computed. - _T. D. Noe_, Jan 13 2007 [edited by _Petros Hadjicostas_, Jul 19 2018] %e A007874 Consider n=4. Label the points on the circle A,B,C and D. Suppose that AB has unit length. Then a(4)=2 because the two 4-gons are ABCDA and ACBDA, with perimeters 4 and 2+2*sqrt(2), respectively. %Y A007874 Cf. A030077. %K A007874 nonn %O A007874 1,4 %A A007874 Peter H. Borcherds (p.h.borcherds(AT)bham.ac.uk) %E A007874 More terms from _T. D. Noe_, Jan 13 2007