User blog:Ynought/OL function (back to graphs yay!)

This function takes in an positive integer larger than one.you start with a square,size doesn’t matter,with all the corners connected with lines looks like

then you apply the following rules: then \(OL(n)\) is the longest game given from the rules above
 * 1) you square the amount of vertices in the current graph(the square in the first run) then you re arange the new number of vertices in a regular pattern (as in regular \(n\)-agon  )
 * 2) connect all the vertices with lines
 * 3) now remove n (from \(OL(n)\) ) + the ammount of leftover vertices in the previous graph (in the first runtrough its just +0) vertices from the graph with the conecting lines of the vertices
 * 4) repeat the rules above until you have two lines that are overlaping (the very center doesnt count)