215766

Appears in sequences

• Closed walks of length n along the edges of a pentagon based at a vertex.at n=20A054877
• a(n) = Sum_{k=0..n} binomial(5*n,5*k).at n=4A070782
• Number of closed walks of length 2n at a vertex of the cyclic graph on 10 nodes C_10.at n=10A095929
• a(n) = Sum_{k >= 0} binomial(n,5*k).at n=20A139398
• a(n) = Sum_{k == floor(n/2) (mod 5)} C(n,k).at n=20A173125
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals: A(n,k) = Sum_{j=0..n} binomial(k*n,k*j).at n=49A308500
• Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.at n=50A361043
• a(n) = Sum_{k=0..n} binomial(3*n+2,5*k).at n=6A387038
• a(n) = Sum_{k=0..n} binomial(2*n,5*k).at n=10A387844
• a(n) = Sum_{k=0..n} binomial(4*n,5*k).at n=5A387848