Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n "corners"; the symmetry group is C3. Walks are not self-avoiding.
1, 3, 4, 10, 16, 36, 64, 136, 256, 528, 1024, 2080, 4096, 8256, 16384, 32896, 65536
3 seqfan posts
Thu Sep 9 00:22:17 CEST 2010 [seqfan] Re: A new way to create OEIS sequence A051437?