Triangular array read by rows. T(n,k) is the number of closed walks of length 2n along the edges of a cube based at vertex v that return to v exactly k times, n>=0, 0<=k<=n.

A336667

Triangular array read by rows. T(n,k) is the number of closed walks of length 2n along the edges of a cube based at vertex v that return to v exactly k times, n>=0, 0<=k<=n.

Terms

    a(0) =1a(1) =0a(2) =3a(3) =0a(4) =12a(5) =9a(6) =0a(7) =84a(8) =72a(9) =27a(10) =0a(11) =588a(12) =648a(13) =324a(14) =81a(15) =0a(16) =4116a(17) =5544a(18) =3564a(19) =1296a(20) =243a(21) =0a(22) =28812a(23) =45864a(24) =35748a(25) =16848a(26) =4860a(27) =729a(28) =0a(29) =201684

External references