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.

A092866 Number of intersections inside an equilateral triangular figure formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. If three or more lines meet at an interior point this intersection is counted only once.

Table of values

n a(n)
1 0
2 4
3 49
4 166
5 543
6 1237
7 2511
8 4762
9 7777
10 12262
11 18933
12 28504
13 39078
14 56065
15 73879
16 95962
17 124653
18 164761
19 203259
20 258646
21 311233
22 377932
23 458793
24 560755
25 648936
26 775258
27 908893
28 1056520
29 1215087
30 1428193
31 1607871
32 1866007
33 2111488
34 2399545
35 2694010
36 3040201
37 3356433
38 3811387
39 4253074
40 4720102
41 5180466
42 5806687
43 6324906
44 7035949
45 7690900
46 8392036
47 9180330
48 10136287
49 10894551
50 11930833

List of values

[0, 4, 49, 166, 543, 1237, 2511, 4762, 7777, 12262, 18933, 28504, 39078, 56065, 73879, 95962, 124653, 164761, 203259, 258646, 311233, 377932, 458793, 560755, 648936, 775258, 908893, 1056520, 1215087, 1428193, 1607871, 1866007, 2111488, 2399545, 2694010, 3040201, 3356433, 3811387, 4253074, 4720102, 5180466, 5806687, 6324906, 7035949, 7690900, 8392036, 9180330, 10136287, 10894551, 11930833]