cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A266183 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any diagonal or antidiagonal neighbor equal to n-1.

This page as a plain text file.
%I A266183 #6 Aug 12 2016 06:55:34
%S A266183 1,1,2,1,2,6,1,2,22,24,1,2,88,384,120,1,2,296,7768,19080,720,1,2,1372,
%T A266183 226296,4027960,1019328,5040,1,2,6128,7089448,1203241488,2437859280,
%U A266183 106546608,40320,1,2,29552,253282792,409870443648,8822224268688
%N A266183 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any diagonal or antidiagonal neighbor equal to n-1.
%C A266183 Table starts
%C A266183 ......1...........1.............1.............1............1.........1
%C A266183 ......2...........2.............2.............2............2.........2
%C A266183 ......6..........22............88...........296.........1372......6128
%C A266183 .....24.........384..........7768........226296......7089448.253282792
%C A266183 ....120.......19080.......4027960....1203241488.409870443648
%C A266183 ....720.....1019328....2437859280.8822224268688
%C A266183 ...5040...106546608.3971117183616
%C A266183 ..40320.11075595648
%C A266183 .362880
%H A266183 R. H. Hardin, <a href="/A266183/b266183.txt">Table of n, a(n) for n = 1..49</a>
%e A266183 Some solutions for n=3 k=4
%e A266183 ..2..0..1..0....0..2..1..2....2..1..0..0....1..2..0..1....0..2..2..0
%e A266183 ..1..2..1..0....1..0..2..0....2..1..0..1....2..0..2..0....1..1..1..1
%e A266183 ..2..0..1..2....1..2..0..1....2..1..2..0....1..1..0..2....2..2..0..0
%Y A266183 Column 1 is A000142.
%Y A266183 Column 2 is A265860.
%K A266183 nonn,tabl
%O A266183 1,3
%A A266183 _R. H. Hardin_, Dec 23 2015