User:Alemagno12/My SSCG sequence

We let o be a dot and o-(a,b,c,...) be a dot connected to a,b,c,... (If there is only one element in the parentheses, we can remove them)
 * 0 = empty graph
 * 1 = o
 * 2 = o+o
 * 3 = o+o+o
 * 4 = o+o+o+o
 * ω = o-o
 * ω+1 = o-o+o
 * ω+2 = o-o+o+o
 * ω2 = o-o+o-o
 * ω3 = o-o+o-o+o-o
 * ω2 = o-o-o
 * ω2+ω = o-o-o+o-o
 * ω22 = o-o-o+o-o-o
 * ω3 = o-o-o-o
 * ω4 = o-o-o-o-o
 * ωω = o-o-(o,o) (Try picturing this as a T-shaped tree, so the next ordinals are easier to understand)
 * ωω+1 = o-o-(o,o-o)
 * ωω+2 = o-o-(o,o-o-o)
 * ωω2 = o-o-(o,o-(o,o))
 * [WIP]