User blog:Ynought/The A function

You take an infinitely large square with lines after every unit and apply the following rules  Then let \(A\)(\(n\)) be the largest number of graphs recreatable with the rules above
 * 1) choose a  line segment of length 1 that’s touching the bottom left corner and rotate it in one of \(n\) angles. 
 * 2) rotate another line segment of length 1 that’s touching one of the already rotated line segments
 * 3) rotate another line segment of length 1 that’s touching one of the already rotated line segments
 * 4) re-apply rule 2-3 until you have a graph that is homeomorphically embeddable in some previous graph