cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A383462 Triangle read by rows: T(n,k) (n >= 3, 2 <= k <= n-1) = number of vertices where k lines cross in the planar graph formed when every pair of vertices of a regular n-gon are joined by an infinite line.

Table of values

n a(n)
3 3
4 1
5 4
6 10
7 0
8 5
9 30
10 1
11 0
12 6
13 84
14 0
15 0
16 0
17 7
18 120
19 16
20 1
21 0
22 0
23 8
24 324
25 0
26 0
27 0
28 0
29 0
30 9
31 420
32 40
33 0
34 1
35 0
36 0
37 0
38 10
39 880
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 11
48 708
49 156
50 24
51 0
52 1
53 0
54 0
55 0
56 0
57 12
58 1950
59 0
60 0
61 0
62 0
63 0
64 0
65 0
66 0
67 0
68 13
69 1890
70 280
71 0
72 0
73 0
74 1
75 0
76 0
77 0
78 0
79 0
80 14

List of values

[3, 1, 4, 10, 0, 5, 30, 1, 0, 6, 84, 0, 0, 0, 7, 120, 16, 1, 0, 0, 8, 324, 0, 0, 0, 0, 0, 9, 420, 40, 0, 1, 0, 0, 0, 10, 880, 0, 0, 0, 0, 0, 0, 0, 11, 708, 156, 24, 0, 1, 0, 0, 0, 0, 12, 1950, 0, 0, 0, 0, 0, 0, 0, 0, 0, 13, 1890, 280, 0, 0, 0, 1, 0, 0, 0, 0, 0, 14]