35704

Appears in sequences

• Number of length n+6 0..3 arrays with at most one downstep in every 6 consecutive neighbor pairs.at n=3A258728
• T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs.at n=39A258730
• Number of length n+4 0..3 arrays with at most one downstep in every n consecutive neighbor pairs.at n=5A258734
• Number of edges formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).at n=15A331765