|
%I #19 Jun 14 2012 19:18:07
%S 2,8,16,18,64,134,34,170,706,1854,60,398,2346,13198,41478,102,880,
%T 6832,55454,382116,1424988
%N Triangle T(n,k) of numbers of distinct shapes under rotation of non-extendable (complete) non-self-adjacent simple paths within a square lattice bounded by rectangles with nodal dimensions n and k, n >= k >= 2.
%C The triangle of numbers is:
%C ....k....2....3.....4......5.......6........7
%C .n
%C .2.......2
%C .3.......8...16
%C .4......18...64...134
%C .5......34..170...706...1854
%C .6......60..398..2346..13198...41478
%C .7.....102..880..6832..55454..382116..1424988
%C The sequence is formed by reading the triangle by rows.
%H C. H. Gribble, <a href="https://oeis.org/wiki/Complete_non-self-adjacent_paths:Results_for_Square_Lattice">Computed characteristics of complete non-self-adjacent paths in a square lattice bounded by various sizes of rectangle.</a>
%H C. H. Gribble, <a href="https://oeis.org/wiki/Complete non-self-adjacent paths:Program">Computes characteristics of complete non-self-adjacent paths in square and cubic lattices bounded by various sizes of rectangle and rectangular cuboid respectively.</a>
%F Let T(n,k) denote an element of the triangle then the following recurrence relations appear to hold:
%F T(n, 2) - T(n-1, 2) - 2*A000045(n+1) = 0, n >= 3,
%F T(n, 3) - 2*T(n-1, 3) - T(n-4, 3) - 4*(n+11) = 0, n >= 7.
%e T(2,2) = The number of rotationally distinct complete non-self-adjacent simple path shapes within a 2 X 2 node rectangle.
%Y Cf. A213106.
%K nonn,tabl
%O 2,1
%A _Christopher Hunt Gribble_, Jun 07 2012
| 