382480

Appears in sequences

• Number of distinct intersections among all circles that can be constructed on vertices of an n-sided regular polygon, using only a compass.at n=39A331702
• Irregular triangle read by rows: T(n,k) is the number of permutations of an n X n Rubik's Square reachable in k or fewer moves, terminating at the maximum value.at n=29A335136