The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A193580 Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board. 13

%I #51 Dec 03 2017 12:07:00

%S 1,1,1,1,4,1,9,16,8,1,1,16,78,140,79,1,25,228,964,1987,1974,978,242,

%T 27,1,1,36,520,3920,16834,42368,62266,51504,21792,3600,1,49,1020,

%U 11860,85275,397014,1220298,2484382,3324193,2882737,1601292,569818,129657,18389,1520,64,1

%N Triangle read by rows: T(n,k) = number of ways to place k nonattacking kings on an n X n board.

%C Rows 2n and 2n-1 both contain 1 + n^2 entries. Cf. A008794.

%C Row n sums to A063443(n+1).

%C Number of walks of length n-1 on a graph in which each node represents a 11-avoiding n-bit binary sequence B and adjacency of B and B' is determined by B'&(B|(B<<1)|(B>>1))=0 and the total number of nonzero bits in the walk is k.

%C Row n gives the coefficients of the independence polynomial of the n X n king graph. - _Eric W. Weisstein_, Jun 20 2017

%D Norman Biggs, Algebraic Graph Theory, Cambridge University Press, New York, NY, second edition, 1993.

%H Alois P. Heinz, <a href="/A193580/b193580.txt">Rows n = 0..21, flattened</a> (Rows n = 0..20 from Andrew Woods)

%H R. J. Mathar, <a href="http://arxiv.org/abs/1609.03964">Tiling n x m rectangles with 1 x 1 and s x s squares</a> arXiv:1609.03964 [math.CO], 2016, Section 4.1.

%H J. Nilsson, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL20/Nilsson/nilsson15.html">On Counting the Number of Tilings of a Rectangle with Squares of Size 1 and 2</a>, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.2.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependencePolynomial.html">Independence Polynomial</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/KingGraph.html">King Graph</a>

%F T(n, 0) = 1;

%F T(n, 1) = n^2;

%F T(2n-1, n^2-1) = n^3;

%F T(2n-1, n^2) = 1.

%e The table begins with T(0,0):

%e 1;

%e 1, 1;

%e 1, 4;

%e 1, 9, 16, 8, 1;

%e 1, 16, 78, 140, 79;

%e ...

%e T(4,3) = 140 because there are 140 ways to place 3 kings on a 4 X 4 chessboard so that no king threatens any other.

%Y Columns 2 to 10: A061995, A061996, A061997, A061998, A172158, A194788, A201369, A201771, A220467.

%Y Diagonal: A201513.

%Y Cf. A179403, etc., for extension to toroidal boards.

%Y Cf. A166540, etc., for extension into three dimensions.

%Y Cf. A098487 for a clipped version.

%Y Row n sums to A063443(n+1).

%K nonn,tabf

%O 0,5

%A _Andrew Woods_, Aug 27 2011

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 May 13 06:37 EDT 2024. Contains 372498 sequences. (Running on oeis4.)