This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172218 Number of ways to place 3 nonattacking nightriders on a 3 X n board. 3
 1, 12, 36, 100, 213, 408, 712, 1148, 1745, 2528, 3524, 4760, 6263, 8060, 10178, 12644, 15485, 18728, 22400, 26528, 31139, 36260, 41918, 48140, 54953, 62384, 70460, 79208, 88655, 98828, 109754, 121460, 133973, 147320, 161528, 176624, 192635 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A nightrider is a fairy chess piece that can move (proportionate to how a knight moves) in any direction. LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 FORMULA a(n) = (9n^3 - 57n^2 + 210n - 344)/2, n>=8. G.f.: x*(2*x^10-4*x^9+6*x^8-4*x^7-6*x^6+24*x^5-18*x^4+24*x^3-6*x^2+8*x+1)/(x-1)^4. - Vaclav Kotesovec, Mar 25 2010 MATHEMATICA CoefficientList[Series[(2 x^10 - 4 x^9 + 6 x^8 - 4 x^7 - 6 x^6 + 24 x^5 - 18 x^4 + 24 x^3 - 6 x^2 + 8 x + 1) / (x - 1)^4, {x, 0, 50}], x] (* Vincenzo Librandi, May 28 2013 *) CROSSREFS Cf. A172141, A061989, A172212. Sequence in context: A080562 A212963 A033196 * A172212 A060621 A058880 Adjacent sequences:  A172215 A172216 A172217 * A172219 A172220 A172221 KEYWORD nonn,easy AUTHOR Vaclav Kotesovec, Jan 29 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 18 20:06 EST 2018. Contains 318245 sequences. (Running on oeis4.)