%I #24 May 07 2023 15:14:23
%S 3,19,31,11,35,31,51,55,155,49
%N Minimum number of unit length rods needed to construct a rigid regular n-gon.
%C The terms in this sequence are the best known solutions and they may not be optimal.
%H Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0100.html">Problem of the Month (January 2000)</a>
%H Ed Pegg, <a href="https://math.stackexchange.com/questions/3954719">Is this braced heptagon a rigid graph?</a>, Mathematics Stack Exchange, December 2020.
%H Kaylee Weatherspoon, <a href="https://scholarcommons.sc.edu/senior_theses/616">Structure of Extremal Unit Distance Graphs</a>, Senior Thesis, Honors College, Univ. S. Carolina - Columbia (2023). See p. 28.
%K hard,more,nonn
%O 3,1
%A _Arkadiusz Wesolowski_, Nov 01 2012
%E a(7) updated according to Jeremy Tan's answer to Ed Pegg's question by _Andrey Zabolotskiy_, Dec 21 2020
%E Name clarified by _Pontus von Brömssen_, May 07 2023