OFFSET
2,1
COMMENTS
At most one king can be placed on each square.
LINKS
Dominic McCarty, Table of n, a(n) for n = 2..100
Matthew Scroggs, Python code to compute A379766
Dominic McCarty, Java program for A379766
Dominic McCarty, Illustration of a(n) for n = 2..100
Index entries for linear recurrences with constant coefficients, signature (1,0,2,-2,0,-1,1).
FORMULA
It appears that a(3n+1) = a(3n+2) - Dominic McCarty, Jan 17 2025
For n >= 2 we have a(n) = 4*floor(n/3)^2+3*floor(n/3)+2 if 3 divides n, a(n) = 4*(floor(n/3)+1)^2 otherwise. - Benoit Cloitre, Jan 17 2025
G.f.: -x^2*(4+5*x+7*x^2-2*x^4-2*x^5-8*x^3+4*x^6)/(1+x+x^2)^2/(x-1)^3 . - R. J. Mathar, Jan 27 2025
EXAMPLE
For a 5 by 5 chessboard, the sixteen kings could be placed like this:
kkokk
kkokk
ooooo
kkokk
kkokk
For a 6 by 6 chessboard, the kings could be placed like this:
kkookk
kkkkkk
okooko
okooko
kkkkkk
kkookk
where o is an empty square and k is a king.
CROSSREFS
KEYWORD
nonn
AUTHOR
Matthew Scroggs, Jan 02 2025
EXTENSIONS
a(9)-a(100) from Dominic McCarty, Jan 17 2025
STATUS
approved