A280639 Triangle read by rows: T(n,k), n>=k>=1, is the number of obtuse isosceles triangles with integral coordinates that have a bounding box of size n X k.
0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 2, 0, 0, 4, 0, 0, 0, 0, 0, 8, 0, 2, 2, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 12, 0, 2, 2, 2, 4, 0, 0, 0, 12, 0, 0, 0, 4, 0, 0, 0, 0, 0, 16, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 2, 2, 2, 2, 6, 4
Offset: 1
Examples
Triangle begins: 0 0,0 0,0,0 0,0,0,4 0,2,0,0,4 0,0,0,0,0,8 0,2,2,0,0,0,8 0,0,0,0,0,0,0,12 0,2,2,2,4,0,0,0,12 0,0,0,4,0,0,0,0,0,16 0,2,2,2,2,0,0,0,0,0,16 0,0,0,0,0,0,0,0,0,0,0,20 0,2,2,2,2,6,4,4,4,0,0,0,20 ------- The obtuse angle is 'o'. For n=4, k=4: x... x... ...x ...x ..o. .... .o.. .... .... .o.. .... ..o. ...x ...x x... x... So T(4,4)=4 ------- For n=5, k=2: x...x ..o.. ..o.. x...x So T(5,2)=2
Links
- Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)
Comments