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.

A331423 Divide each side of a triangle into 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 1
3 0
4 7
5 0
6 13
7 0
8 19
9 0
10 25
11 0
12 31
13 0
14 37
15 6
16 43
17 0
18 49
19 0
20 61
21 0
22 61
23 0
24 91
25 0
26 73
27 0
28 79
29 0
30 91
31 0
32 91
33 0
34 97
35 12
36 103
37 0
38 109
39 0
40 133
41 0
42 133
43 0
44 127
45 42
46 133
47 0
48 187
49 0
50 145
51 0
52 151
53 0
54 157
55 12
56 175
57 0
58 169
59 0
60 235
61 0
62 181
63 48
64 187
65 6
66 205
67 0
68 199
69 0

List of values

[0, 1, 0, 7, 0, 13, 0, 19, 0, 25, 0, 31, 0, 37, 6, 43, 0, 49, 0, 61, 0, 61, 0, 91, 0, 73, 0, 79, 0, 91, 0, 91, 0, 97, 12, 103, 0, 109, 0, 133, 0, 133, 0, 127, 42, 133, 0, 187, 0, 145, 0, 151, 0, 157, 12, 175, 0, 169, 0, 235, 0, 181, 48, 187, 6, 205, 0, 199, 0]