Number of n-step walks from one of the vertices with degree 3 to itself on the four-vertex diamond graph.

A344261

Number of n-step walks from one of the vertices with degree 3 to itself on the four-vertex diamond graph.

Terms

    a(0) =1a(1) =0a(2) =3a(3) =4a(4) =15a(5) =32a(6) =91a(7) =220a(8) =583a(9) =1464a(10) =3795a(11) =9652a(12) =24831a(13) =63440a(14) =162763a(15) =416524a(16) =1067575a(17) =2733672a(18) =7003971a(19) =17938660a(20) =45954543a(21) =117709184a(22) =301527355a(23) =772364092a(24) =1978473511a(25) =5067929880a(26) =12981823923a(27) =33253543444a(28) =85180839135a(29) =218195012912

External references