|
%I #4 Jan 22 2016 13:23:56
%S 1,2,2,4,14,4,11,96,96,11,29,726,1625,726,29,77,5046,30145,30145,5046,
%T 77,201,35574,493087,1414023,493087,35574,201,525,242406,8239879,
%U 56103165,56103165,8239879,242406,525,1361,1653750,130870815,2290723921
%N T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.
%C Table starts
%C ....1........2............4..............11...............29................77
%C ....2.......14...........96.............726.............5046.............35574
%C ....4.......96.........1625...........30145...........493087...........8239879
%C ...11......726........30145.........1414023.........56103165........2290723921
%C ...29.....5046.......493087........56103165.......5180448783......495859988413
%C ...77....35574......8239879......2290723921.....495859988413...112089546220707
%C ..201...242406....130870815.....87407239371...43614373673363.22894037516177941
%C ..525..1653750...2082478515...3343976341229.3849196727799125
%C .1361.11113926..32398824901.124140022659137
%C .3525.74553750.502697528961
%H R. H. Hardin, <a href="/A267957/b267957.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: a(n) = 3*a(n-1) +2*a(n-2) -8*a(n-3) for n>5
%F k=2: [order 6] for n>8
%F k=3: [order 56]
%e Some solutions for n=3 k=4
%e ..0..1..0..0....0..1..0..0....0..0..1..0....0..1..0..1....0..1..0..0
%e ..0..1..1..2....2..2..1..2....1..2..1..1....1..0..1..1....2..2..1..0
%e ..1..0..0..1....2..1..0..0....0..0..2..1....1..2..2..0....1..0..0..1
%Y Column 1 is A267912.
%Y Column 2 is A267913.
%K nonn,tabl
%O 1,2
%A _R. H. Hardin_, Jan 22 2016
| 