154845

Appears in sequences

• Number of length n+6 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=15A255113
• Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of edges in H_n.at n=26A370979