OFFSET
1,1
LINKS
Bruno Berselli, Table of n, a(n) for n = 1..200
D. E. Knuth, Nonattacking kings on a chessboard, 1994.
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 90.
H. S. Wilf, The problem of the kings, Elec. J. Combin. 2, 1995.
Index entries for linear recurrences with constant coefficients, signature (9,-28,33,-9).
FORMULA
MAPLE
with(combinat): A061593:=n->(17*n-109)*3^n+2*fibonacci(2*n+10): seq(A061593(n), n=1..30); # Wesley Ivan Hurt, Nov 08 2014
MATHEMATICA
Table[(17 n - 109)*3^n + 2 Fibonacci[2 n + 10], {n, 30}] (* Wesley Ivan Hurt, Nov 08 2014 *)
CoefficientList[Series[x (12-29x+33x^2-9x^3)/((1-3x+x^2)(1-3x)^2), {x, 0, 30}], x] (* or *) LinearRecurrence[{9, -28, 33, -9}, {0, 12, 79, 408, 1847}, 30] (* Harvey P. Dale, Dec 20 2021 *)
PROG
(Magma) [(17*n-109)*3^n+2*Fibonacci(2*n+10): n in [1..30]]; // Vincenzo Librandi, Jul 12 2011
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 22 2001
STATUS
approved