103702

Appears in sequences

• Number of walks of length 2n+1 between two nodes at distance 3 in the cycle graph C_10.at n=8A095932
• a(n) = Sum_{k>=0} binomial(n,5*k+1).at n=19A133476
• a(n) = Sum_{ k >= 0} binomial(n,5*k+3).at n=19A139748
• Number of nX7 1..2 arrays containing at least one of each value, all equal values connected, and rows considered as a single number in nondecreasing order.at n=4A166793
• Number of (n+1) X (6+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=6A235085
• Number of (n+1) X (7+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=5A235086
• a(n) = Sum_{k=0..n} binomial(5*n+4,5*k+1).at n=3A387813