cp's OEIS Frontend

A265232 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal vertical neighbors and new values introduced sequentially from 0.

%I A265232 #9 Aug 12 2016 06:55:34
%S A265232 1,1,1,1,2,1,1,4,7,1,1,8,56,43,1,1,16,495,2592,372,1,1,32,4686,184740,
%T A265232 222850,4027,1,1,64,46456,14439456,164933040,29357385,51871,1,1,128,
%U A265232 475392,1196114464,137409486772,277778385204,5460708807,773186,1,1,256
%N A265232 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal vertical neighbors and new values introduced sequentially from 0.
%C A265232 Table starts
%C A265232 .1........1.............1...............1................1...............1
%C A265232 .1........2.............4...............8...............16..............32
%C A265232 .1........7............56.............495.............4686...........46456
%C A265232 .1.......43..........2592..........184740.........14439456......1196114464
%C A265232 .1......372........222850.......164933040.....137409486772.123531282436770
%C A265232 .1.....4027......29357385....277778385204.3045763404200768
%C A265232 .1....51871....5460708807.785263649477535
%C A265232 .1...773186.1360701035812
%C A265232 .1.13083385
%C A265232 .1
%H A265232 R. H. Hardin, <a href="/A265232/b265232.txt">Table of n, a(n) for n = 1..60</a>
%e A265232 Some solutions for n=4 k=4
%e A265232 ..0..1..1..2....0..0..1..1....0..0..1..2....0..1..0..0....0..0..0..1
%e A265232 ..1..0..3..0....2..2..3..0....2..1..3..3....2..3..2..1....2..3..2..3
%e A265232 ..2..1..0..2....1..1..0..3....1..2..0..0....3..2..1..3....1..1..3..0
%e A265232 ..3..2..3..3....2..3..3..2....3..1..3..2....0..1..3..2....2..3..2..1
%Y A265232 Row 2 is A000079(n-1); row 3 is A265233; row 4 is A265234; column 3 is A265230.
%Y A265232 Diagonal is A264939.
%K A265232 nonn,tabl
%O A265232 1,5
%A A265232 _R. H. Hardin_, Dec 06 2015