Number of walks of length n along the edges of a dodecahedron graph between two vertices at distance two.

A375309

Number of walks of length n along the edges of a dodecahedron graph between two vertices at distance two.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =1a(4) =7a(5) =11a(6) =51a(7) =105a(8) =399a(9) =967a(10) =3299a(11) =8789a(12) =28271a(13) =79443a(14) =247507a(15) =716353a(16) =2193583a(17) =6452639a(18) =19575075a(19) =58095597a(20) =175350735a(21) =522947755a(22) =1574075603a(23) =4706879321a(24) =14146450127a(25) =42363311991a(26) =127217598691a(27) =381275400325

External references