1669801

Appears in sequences

• Number of walks of length 2n+1 between two nodes at distance 3 in the cycle graph C_10.at n=10A095932
• a(n) = Sum_{k >= 0} binomial(n,5*k).at n=23A139398
• a(n) = Sum_{ k >= 0} binomial(n,5*k+3).at n=23A139748
• a(n) = Sum_{k=0..n} binomial(5*n+3,5*k).at n=4A345457
• a(n) = Sum_{k=0..n} binomial(3*n+2,5*k).at n=7A387038
• a(n) = Sum_{k=0..n} binomial(2*n+1,5*k).at n=11A387871
• a(n) = Sum_{k=0..n} binomial(4*n+3,5*k).at n=5A387906