167898

Appears in sequences

• Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct path lengths.at n=15A030077
• T(2n+6,n), array T as in A055216.at n=8A055222
• Number of length n+1 0..2 arrays with at most two downsteps in every n consecutive neighbor pairs.at n=12A255623
• Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct multisets of segment lengths.at n=15A352568