4686826

Appears in sequences

• Number of walks of length n between two adjacent nodes in the cycle graph C_9.at n=25A095364
• a(n) = binomial(n, 9) + 1.at n=27A115205
• a(n) = Sum_{k=0..floor(n/9)} binomial(n,9*k).at n=26A306860
• Expansion of 1/((1 - x)^9 - x^9).at n=18A306939