cp's OEIS Frontend

A222555 T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.

%I A222555 #6 Jun 02 2025 08:27:38
%S A222555 1,7,2,31,20,4,121,102,64,8,456,427,359,208,16,1709,1668,1562,1279,
%T A222555 651,32,6427,6372,6220,5761,4537,2056,64,24301,24230,24024,23341,
%U A222555 21239,15929,6496,128,92368,92279,92011,91052,87752,78245,56041,20483,256,352705
%N A222555 T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places but not 0.
%C A222555 Table starts
%C A222555 ...1.....7.....31....121....456...1709...6427..24301..92368.352705
%C A222555 ...2....20....102....427...1668...6372..24230..92279.352596
%C A222555 ...4....64....359...1562...6220..24024..92011.352258
%C A222555 ...8...208...1279...5761..23341..91052.350967
%C A222555 ..16...651...4537..21239..87752.346091
%C A222555 ..32..2056..15929..78245.330274
%C A222555 ..64..6496..56041.287858
%C A222555 .128.20483.197313
%C A222555 .256.64627
%C A222555 .512
%H A222555 R. H. Hardin, <a href="/A222555/b222555.txt">Table of n, a(n) for n = 1..55</a>
%e A222555 Some solutions for n=3 k=4
%e A222555 ..0....1....3....1....0....1....0....2....0....2....0....0....2....0....1....0
%e A222555 ..2....0....0....0....1....2....0....2....3....2....1....0....0....1....0....1
%e A222555 ..1....1....0....0....0....1....3....2....0....3....0....2....1....2....3....0
%e A222555 ..1....0....1....4....1....1....1....1....1....0....0....2....0....0....3....0
%e A222555 ..0....2....1....0....1....2....0....0....0....0....0....0....3....4....0....1
%e A222555 ..3....2....1....1....0....0....1....0....1....0....4....2....0....0....0....4
%e A222555 ..0....1....1....1....4....0....2....0....2....0....2....1....1....0....0....1
%Y A222555 Column 1 is A000079(n-1)
%Y A222555 Row 1 is A048775
%K A222555 nonn,tabl
%O A222555 1,2
%A A222555 _R. H. Hardin_ Feb 24 2013