Number of walks of length n between two adjacent nodes in the cycle graph C_9.

Terms

a(0) =1a(1) =0a(2) =3a(3) =0a(4) =10a(5) =0a(6) =35a(7) =1a(8) =126a(9) =11a(10) =462a(11) =78a(12) =1716a(13) =455a(14) =6435a(15) =2380a(16) =24311a(17) =11628a(18) =92398a(19) =54264a(20) =352947a(21) =245157a(22) =1354102a(23) =1081575a(24) =5215250a(25) =4686826a(26) =20156580a(27) =20030039a(28) =78152535a(29) =84672780