Counting closed walks in infinite regular trees using Catalan and Borel's triangles

Abstract

We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.