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!)
A317714 Chessboard rectangles sequence (see Comments), also A037270 interleaved with A163102. 2
0, 0, 1, 2, 10, 18, 45, 72, 136, 200, 325, 450, 666, 882, 1225, 1568, 2080, 2592, 3321, 4050, 5050, 6050, 7381, 8712, 10440, 12168, 14365, 16562, 19306, 22050, 25425, 28800, 32896, 36992, 41905, 46818, 52650, 58482, 65341, 72200, 80200, 88200, 97461, 106722, 117370 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Take a chessboard of n X n unit squares in which the a1 square is black. a(n) is the number of composite rectangles of p x q unit squares whose vertices are covered by black unit squares (1 < p <= n, 1 < q <= n).

LINKS

Jinyuan Wang, Table of n, a(n) for n = 1..10000

Index entries for linear recurrences with constant coefficients, signature (2,2,-6,0,6,-2,-2,1).

FORMULA

a(n) = 2*a(n-1) + 2*a(n-2) - 6*a(n-3) + 6*a(n-5) - 2*a(n-6) - 2*a(n-7) + a(n-8), with a(1)=0, a(2)=0, a(3)=1, a(4)=2, a(5)=10, a(6)=18, a(7)=45, a(8)=72.

G.f.: -(x^3*(1+ 4*x^2 + x^4))/((-1+x)^5*(1+x)^3).

a(n) = (5 - 5*(-1)^n - 12*n + 12*(-1)^n*n + 14*n^2 - 6*(-1)^n*n^2 - 8*n^3 + 2*n^4)/64.

a(n) = Sum_{i=1..n-1} floor(i/2)^3. - Ridouane Oudra, Jul 24 2019

E.g.f.: (1/64)*exp(-x)*(-5-6*x-6*x^2+exp(2*x)*(5-4*x+4*x^2+4*x^3+2*x^4)). - Stefano Spezia, Aug 14 2019

a(n) = (1/2)*(t^2 + 2*(n-1)*t^3 - 3*t^4), where t = floor(n/2). - Ridouane Oudra, Aug 15 2019

EXAMPLE

In a 4 X 4 chessboard there are two such rectangles (for both p=q=3) and the coordinates of their lower left vertices are a1 and b2). Therefore, a(4)=2.

MATHEMATICA

CoefficientList[Series[-((x^2 (1+4 x^2+x^4))/((-1+x)^5 (1+x)^3)), {x, 0, 44}], x]

LinearRecurrence[{2, 2, -6, 0, 6, -2, -2, 1}, {0, 0, 1, 2, 10, 18, 45, 72}, 80] (* Vincenzo Librandi, Aug 06 2018 *)

PROG

(Magma) [(5-5*(-1)^n-12*n+12*(-1)^n*n+14*n^2-6*(-1)^n*n^2-8*n^3+2*n^4)/64: n in [1..50]]; // Vincenzo Librandi, Aug 05 2018

(Python)

n, a = 0, 0

while n < 10:

print(n, a)

n, a = n+1, a+((n+1)//2)**3 # A.H.M. Smeets, Aug 09 2019

(PARI) a(n) = sum(i = 1, n-1, floor(i/2)^3); \\ Jinyuan Wang, Aug 12 2019

CROSSREFS

Cf. A005993, A037270, A163102.

Sequence in context: A092062 A271786 A134251 * A055260 A254059 A346551

Adjacent sequences: A317711 A317712 A317713 * A317715 A317716 A317717

KEYWORD

easy,nonn

AUTHOR

Ivan N. Ianakiev, Aug 05 2018

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 February 5 20:57 EST 2023. Contains 360087 sequences. (Running on oeis4.)