OFFSET
1,3
COMMENTS
Place all bounding boxes of A280652 that will fit into the n X n grid in all possible positions, and the proper rectangles in two orientations: a(n) = Sum_{i=1..n} Sum_{j=1..i} k * (n-i+1) * (n-j+1) * A280652(i,j) where k=1 when i=j and k=2 otherwise. - Lars Blomberg, Mar 02 2017
According to Langford (p. 243), the leading order is (97/150 + Pi/40)*C(n^2,3). See A093072. - Michael R Peake, Jan 15 2021
LINKS
Lars Blomberg, Table of n, a(n) for n = 1..10000
Margherita Barile, MathWorld -- Geoboard.
Eric Langford, A problem in geometric probability, Mathematics Magazine, Nov-Dec, 1970, 237-244.
Eric Weisstein's World of Mathematics, Obtuse Triangle.
CROSSREFS
KEYWORD
nonn
AUTHOR
Martin Renner, May 04 2011
EXTENSIONS
Extended by Ray Chandler, May 04 2011
STATUS
approved