OFFSET
0,3
LINKS
EXAMPLE
For n=2, the a(2) = 4 solutions visit one of the four vertices adjacent to the initial vertex, and then return.
For n=5, the a(5) = 8 solutions consist of counterclockwise or clockwise traversals of the circumference of any of the four pentagons that surround the initial vertex.
CROSSREFS
The accompanying sequences for the number of paths that return to a degree-3 node is A357811.
KEYWORD
nonn,easy,walk
AUTHOR
Dave R.M. Langers, Oct 13 2022
STATUS
approved