This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A030117 Number of triangles a queen can make (starting anywhere) on an n X n board. 1
 0, 0, 4, 28, 80, 180, 332, 560, 864, 1272, 1780, 2420, 3184, 4108, 5180, 6440, 7872, 9520, 11364, 13452, 15760, 18340, 21164, 24288, 27680, 31400, 35412, 39780, 44464, 49532, 54940, 60760, 66944, 73568, 80580, 88060, 95952, 104340, 113164 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Problem of the week, Web site - problem 855 FORMULA Harris Kwong (kwong(AT)cs.fredonia.edu): 13 Binomial[ n, 3 ] + 5 Binomial[ n, 2 ] if n is odd or 13 Binomial[ n, 3 ] + 5 Binomial[ n, 2 ] - n/2 if n is even. Contribution from Sergey Perepechko, Dec 03 2008: (Start) G.f.: 4*x^2*(2*x^3+5*x^2+5*x+1)/((x - 1)^4*(x + 1)^2). Also a(n)=n*((n-1)*(13*n-8)/6-[n/2]), where [x]=floor(x). Also a(n)+(3*n-1)*binomial(n,3) gives number of cycles of length 3 in a queen's graph associated with this chessboard (see A144298). (End) CROSSREFS Sequence in context: A085024 A085001 A153784 * A005634 A183485 A183437 Adjacent sequences:  A030114 A030115 A030116 * A030118 A030119 A030120 KEYWORD nonn,easy AUTHOR EXTENSIONS More terms from Erich Friedman. 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 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)