695799

Appears in sequences

• a(n) is the smallest number which can be represented as the sum of n distinct nonzero n-gonal pyramidal numbers in exactly n ways, or -1 if no such number exists.at n=22A350397
• Let G_n denote the planar graph defined in A358746 with the addition, if n is odd, of the circle containing the initial n points; sequence gives the number of edges in G_n.at n=38A370977