6643782

Appears in sequences

• Closed walks of length n along the edges of a pentagon based at a vertex.at n=25A054877
• a(n) = 2^n - A056188(n).at n=24A056189
• a(n) = Sum_{k=0..n} binomial(5*n,5*k).at n=5A070782
• Number of walks of length 2n+1 between two nodes at distance 5 in the cycle graph C_10.at n=10A095933
• a(n) = Sum_{k >= 0} binomial(n,5*k).at n=25A139398
• a(n) = Sum_{k=0..n} C(n^2, n*k).at n=5A167009
• sum_{k=floor[(n+5)/2] mod 5} C(n,k).at n=25A173126
• 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=60A308500
• 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=60A361043
• a(n) = Sum_{k=0..n} binomial(2*n+1,5*k).at n=12A387871
• a(n) = Sum_{k=0..n} binomial(3*n+1,5*k).at n=8A387872
• a(n) = Sum_{k=0..n} binomial(4*n+1,5*k).at n=6A387873