cp's OEIS Frontend

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

%I A264945 #6 Aug 12 2016 06:55:34
%S A264945 1,0,1,0,2,1,0,1,8,1,0,2,56,60,1,0,1,332,3201,544,1,0,2,2350,184740,
%T A264945 307016,6040,1,0,1,16108,11375145,196389904,43200625,79008,1,0,2,
%U A264945 114148,730983420,137409486772,368696849320,8403205056,1190672,1,0,1,817280
%N A264945 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal neighbors and new values introduced sequentially from 0.
%C A264945 Table starts
%C A264945 .1.....0..........0................0.....................0....................0
%C A264945 .1.....2..........1................2.....................1....................2
%C A264945 .1.....8.........56..............332..................2350................16108
%C A264945 .1....60.......3201...........184740..............11375145............730983420
%C A264945 .1...544.....307016........196389904..........137409486772......102117302729744
%C A264945 .1..6040...43200625.....368696849320......3537141103745065.36724170744914466520
%C A264945 .1.79008.8403205056.1122409297218768.173357342638694530002
%H A264945 R. H. Hardin, <a href="/A264945/b264945.txt">Table of n, a(n) for n = 1..66</a>
%e A264945 Some solutions for n=4 k=4
%e A264945 ..0..1..0..2....0..1..0..1....0..1..2..0....0..1..0..2....0..1..2..0
%e A264945 ..0..1..0..2....2..3..1..0....3..0..3..2....1..0..2..0....3..2..1..2
%e A264945 ..2..3..1..3....0..1..2..3....1..2..0..2....1..3..2..3....1..2..3..0
%e A264945 ..3..1..3..2....3..2..3..2....3..1..3..1....3..1..3..2....3..0..3..1
%Y A264945 Column 2 is A053871.
%K A264945 nonn,tabl
%O A264945 1,5
%A A264945 _R. H. Hardin_, Nov 29 2015