93995

Appears in sequences

• The number of bidirectional ballot sequences of length n, i.e., the number of 0-1 sequences of length n such that every prefix and every suffix has more 1's than 0's.at n=22A167510
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n*k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of edges in the resulting planar graph.at n=47A367305
• Numbers k such that k and k+1 are both terms in A377732.at n=32A377733