152191

Appears in sequences

• Number of nondecreasing arrangements of n nonzero numbers in -(n-1)..(n-1) with sum zero.at n=9A188325
• T(n,k)=Number of nondecreasing arrangements of n nonzero numbers in -(n+k-2)..(n+k-2) with sum zero.at n=54A188333
• Number of n-node Stanley graphs without isolated nodes.at n=8A323842
• Numbers of squares formed by this procedure on n-th step: Step 1, draw a unit square. Step n, draw a unit square with center in every intersection of lines of the figure in step n-1.at n=38A336288
• Triangle read by rows: T(n,k) is the number of n-node Stanley graphs containing exactly k isolated points, n>=0, 0<=k<=n.at n=36A383655