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!)
A172202 Number of ways to place 3 nonattacking kings on a 3 X n board. 7
0, 0, 8, 34, 105, 248, 490, 858, 1379, 2080, 2988, 4130, 5533, 7224, 9230, 11578, 14295, 17408, 20944, 24930, 29393, 34360, 39858, 45914, 52555, 59808, 67700, 76258, 85509, 95480, 106198, 117690, 129983, 143104, 157080, 171938, 187705 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = (n-2)*(9*n^2 - 45*n + 70)/2, n>=2.
G.f.: x^3*(8+2*x+17*x^2)/(1-x)^4. - Vaclav Kotesovec, Mar 24 2010
E.g.f.: 70 + 17*x + (1/2)*(-140 + 106*x - 36*x^2 + 9*x^3)*exp(x). - G. C. Greubel, Apr 29 2022
MATHEMATICA
CoefficientList[Series[x^2*(8+2*x+17*x^2)/(1-x)^4, {x, 0, 50}], x] (* Vincenzo Librandi, May 27 2013 *)
LinearRecurrence[{4, -6, 4, -1}, {0, 0, 8, 34, 105}, 40] (* Harvey P. Dale, Oct 07 2023 *)
PROG
(Magma) [0] cat [(n-2)*(9*n^2-45*n+70)/2: n in [2..50]]; // G. C. Greubel, Apr 29 2022
(SageMath) [(1/8)*(n-2)*(9*(2*n-5)^2+55) +17*bool(n==1) for n in (1..50)] # G. C. Greubel, Apr 29 2022
CROSSREFS
Sequence in context: A240785 A066804 A033455 * A053298 A196311 A196284
KEYWORD
nonn,easy
AUTHOR
Vaclav Kotesovec, Jan 29 2010
EXTENSIONS
More terms from Vincenzo Librandi, May 27 2013
STATUS
approved

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 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)