Number of walks of length 2n+1 between two nodes at distance 3 in the cycle graph C_10.
A095932
Number of walks of length 2n+1 between two nodes at distance 3 in the cycle graph C_10.
Terms
- a(0) =1a(1) =5a(2) =22a(3) =93a(4) =385a(5) =1574a(6) =6385a(7) =25773a(8) =103702a(9) =416405a(10) =1669801a(11) =6690150a(12) =26789257a(13) =107232053a(14) =429124630a(15) =1717012749a(16) =6869397265a(17) =27481113638a(18) =109933682017a(19) =439758885885
External references
- oeis: A095932