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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267901 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0. 5

%I #5 Aug 12 2016 06:55:35

%S 0,1,0,1,2,0,1,3,6,0,1,11,20,30,0,1,29,268,138,192,0,1,93,2324,17658,

%T 1488,1560,0,1,268,28318,414138,1696920,20400,15120,0,1,842,315196,

%U 28493946,134764368,273460560,317520,171360,0,1,2547,3786836,1246334388

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.

%C Table starts

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

%C .0......2......3........11........29.......93........268.....842.2547

%C .0......6.....20.......268......2324....28318.....315196.3786836

%C .0.....30....138.....17658....414138.28493946.1246334388

%C .0....192...1488...1696920.134764368

%C .0...1560..20400.273460560

%C .0..15120.317520

%C .0.171360

%C .0

%e Some solutions for n=4 k=4

%e ..0..0..2..2....0..0..3..3....0..0..3..3....0..2..3..3....0..0..0..3

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

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

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

%Y Column 2 is A005922(n-1).

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Jan 22 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 20 14:34 EDT 2024. Contains 374445 sequences. (Running on oeis4.)