Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Jul 18 2012 21:07:08
%S 24,76,320,188,1040,4608,408,2756,18636,104272,832,8368,67952,513460,
%T 3349208,1624,21468,228432,2312112,19845964,152434216,3080,53108,
%U 730772,9943160,113061272,1125079096,10676325280,5716,128072,2261792,41508164,629214072,8150708696,99701732480,1200653865056
%N Triangle T(n,k) of the numbers of nodes in all 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...........8.............9
%C .n
%C .2.......24
%C .3.......76....320
%C .4......188...1040....4608
%C .5......408...2756...18636...104272
%C .6......832...8368...67952...513460...3349208
%C .7.....1624..21468..228432..2312112..19845964..152434216
%C .8.....3080..53108..730772..9943160.113061272.1125079096.10676325280
%C .9.....5716.128072.2261792.41508164.629214072.8150708696.99701732480.1200653865056
%C Reading this triangle by rows gives the sequence.
%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>
%e T(2,2) = The number of nodes in all complete non-self-adjacent simple paths within a 2 X 2 node rectangle.
%Y Cf. A213106, A213249.
%K nonn,tabl
%O 2,1
%A _Christopher Hunt Gribble_, Jul 15 2012