A334709 - cp's OEIS frontend

A334709 Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	8
14	0
15	0
16	0
17	0
18	48
19	48
20	0
21	0
22	0
23	0
24	144
25	240
26	144
27	0
28	0
29	0
30	0
31	348
32	716
33	716
34	348
35	0
36	0
37	0
38	0
39	700
40	1712
41	2100
42	1712
43	700
44	0
45	0
46	0
47	0
48	1280
49	3404
50	4984
51	4984
52	3404
53	1280
54	0
55	0
56	0
57	0
58	2144
59	6176
60	9900
61	11604
62	9900
63	6176
64	2144
65	0
66	0
67	0
68	0
69	3400
70	10336
71	17936
72	22936
73	22936
74	17936
75	10336
76	3400
77	0
78	0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 48, 48, 0, 0, 0, 0, 144, 240, 144, 0, 0, 0, 0, 348, 716, 716, 348, 0, 0, 0, 0, 700, 1712, 2100, 1712, 700, 0, 0, 0, 0, 1280, 3404, 4984, 4984, 3404, 1280, 0, 0, 0, 0, 2144, 6176, 9900, 11604, 9900, 6176, 2144, 0, 0, 0, 0, 3400, 10336, 17936, 22936, 22936, 17936, 10336, 3400, 0, 0]

cp's OEIS Frontend

A334709 Array read by antidiagonals: T(n,k) (n>=1, k>=1) = number of ways to select four points from an n X k grid so that three of them form a triangle of nonzero area and the extra point is strictly inside the triangle.

Table of values

List of values