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.

A331428 Divide each side of a triangle into 2*n-1 (n>=1) equal parts and trace the corresponding cevians, i.e., join every point, except for the first and last ones, with the opposite vertex. a(n) is the number of points at which three cevians meet.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 42, 0, 0, 0, 0, 12, 0, 0, 0, 48, 6, 0, 0, 0, 0, 6, 12, 0, 0, 0, 6, 0, 0, 12, 0, 0, 0, 24, 0, 0, 90, 0, 0, 0, 0, 0, 12, 12, 0, 0, 0, 0, 0, 0, 0, 66, 0, 0, 0, 24, 0, 0, 0, 0, 12, 0, 0, 0, 12, 0]