cp's OEIS Frontend

A234760 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.

%I A234760 #6 Jul 23 2025 08:24:38
%S A234760 110,1014,1014,8968,26642,8968,80010,646036,646036,80010,712722,
%T A234760 15939010,41065150,15939010,712722,6350732,392044622,2683721676,
%U A234760 2683721676,392044622,6350732,56585338,9648827736,174451064914,469243923298
%N A234760 T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.
%C A234760 Table starts
%C A234760 .....110.......1014...........8968.............80010...............712722
%C A234760 ....1014......26642.........646036..........15939010............392044622
%C A234760 ....8968.....646036.......41065150........2683721676.........174451064914
%C A234760 ...80010...15939010.....2683721676......469243923298.......81436516016562
%C A234760 ..712722..392044622...174451064914....81436516016562....37650372740746368
%C A234760 .6350732.9648827736.11352560005654.14155719250115192.17443322778721788150
%H A234760 R. H. Hardin, <a href="/A234760/b234760.txt">Table of n, a(n) for n = 1..144</a>
%F A234760 Empirical for column k:
%F A234760 k=1: a(n) = 8*a(n-1) +10*a(n-2) -16*a(n-3) -8*a(n-4) +4*a(n-5) +a(n-6)
%F A234760 k=2: [order 17]
%F A234760 k=3: [order 55]
%e A234760 Some solutions for n=2 k=4
%e A234760 ..0..0..3..2..3....0..0..2..3..3....0..0..1..1..1....0..0..1..1..0
%e A234760 ..0..1..2..2..1....0..1..2..2..3....0..0..0..0..1....0..0..1..0..1
%e A234760 ..0..0..3..1..0....0..0..0..1..1....0..0..0..0..2....1..0..0..1..1
%K A234760 nonn,tabl
%O A234760 1,1
%A A234760 _R. H. Hardin_, Dec 30 2013