Number of walks of length n between two nodes at distance 3 in the cycle graph C_9.

Terms

a(0) =1a(1) =0a(2) =5a(3) =1a(4) =21a(5) =8a(6) =84a(7) =45a(8) =330a(9) =221a(10) =1287a(11) =1015a(12) =5006a(13) =4488a(14) =19465a(15) =19380a(16) =75753a(17) =82365a(18) =295261a(19) =346104a(20) =1152944a(21) =1442101a(22) =4510830a(23) =5969561a(24) =17682795a(25) =24582663a(26) =69448446a(27) =100804436a(28) =273241161a(29) =411921832