Number of non-intersecting polygons that it is possible for an accelerating ant to produce with n steps (rotations & reflections not included). On step 1 the ant moves forward 1 unit, then turns left or right and proceeds 2 units, then turns left or right until at the end of its n-th step it arrives back at its starting place.
A101856
Number of non-intersecting polygons that it is possible for an accelerating ant to produce with n steps (rotations & reflections not included). On step 1 the ant moves forward 1 unit, then turns left or right and proceeds 2 units, then turns left or right until at the end of its n-th step it arrives back at its starting place.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =0a(6) =1a(7) =1a(8) =0a(9) =0a(10) =0a(11) =0a(12) =0a(13) =0a(14) =1a(15) =3a(16) =0a(17) =0a(18) =0a(19) =0a(20) =0a(21) =0a(22) =25a(23) =67a(24) =0a(25) =0a(26) =0a(27) =0a(28) =0a(29) =0
External references
- oeis: A101856