The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265882 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal neighbor equal to n-1. 6

%I

%S 1,0,2,0,2,6,0,2,24,24,0,2,152,792,120,0,2,894,30488,39360,720,0,2,

%T 5748,1584088,18437120,2396880,5040,0,2,38296,90246168,10856237680,

%U 13734486480,241012800,40320,0,2,263484,5533645144,7213744082208

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal neighbor equal to n-1.

%C Table starts

%C .......1.............0.................0...................0..................0

%C .......2.............2.................2...................2..................2

%C .......6............24...............152.................894...............5748

%C ......24...........792.............30488.............1584088...........90246168

%C .....120.........39360..........18437120.........10856237680......7213744082208

%C .....720.......2396880.......13734486480.....105870775847760.955702928168691408

%C ....5040.....241012800....21429982230720.2630918094778547280

%C ...40320...27159592320.40229528835726720

%C ..362880.4466274785280

%C .3628800

%H R. H. Hardin, <a href="/A265882/b265882.txt">Table of n, a(n) for n = 1..55</a>

%e Some solutions for n=3 k=4

%e ..0..1..0..1....0..0..1..0....0..1..2..2....0..1..2..2....2..1..0..0

%e ..2..2..2..2....0..1..2..1....1..2..2..1....1..2..1..0....1..2..1..2

%e ..0..1..0..1....2..2..1..2....0..0..0..1....0..0..1..2....2..1..0..0

%Y Column 1 is A000142.

%K nonn,tabl

%O 1,3

%A _R. H. Hardin_, Dec 17 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 20 20:15 EDT 2022. Contains 353876 sequences. (Running on oeis4.)