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!)
A265241 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal antidiagonal neighbors and new values introduced sequentially from 0. 7

%I #6 Aug 12 2016 06:55:34

%S 1,1,1,1,2,1,1,4,10,1,1,8,92,68,1,1,16,888,4716,604,1,1,32,8880,

%T 359172,414716,6584,1,1,64,91180,29189088,327847656,55210372,85048,1,

%U 1,128,955320,2481226704,284341627344,559450092072,10337500044,1269680,1,1,256

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

%C Table starts

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

%C .1....2........4............8...............16...................32

%C .1...10.......92..........888.............8880................91180

%C .1...68.....4716.......359172.........29189088...........2481226704

%C .1..604...414716....327847656.....284341627344......262625535902888

%C .1.6584.55210372.559450092072.6395116792255680.79291881287786838864

%H R. H. Hardin, <a href="/A265241/b265241.txt">Table of n, a(n) for n = 1..71</a>

%e Some solutions for n=3 k=4

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

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

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

%Y Column 2 is A165968(n+1).

%Y Row 2 is A000079(n-1).

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Dec 06 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)