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.

A061866 a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 2
5 4
6 8
7 13
8 20
9 30
10 42
11 57
12 76
13 98
14 124
15 155
16 190
17 230
18 276
19 327
20 384
21 448
22 518
23 595
24 680
25 772
26 872
27 981
28 1098
29 1224
30 1360
31 1505
32 1660
33 1826
34 2002
35 2189
36 2388
37 2598
38 2820
39 3055
40 3302
41 3562
42 3836
43 4123
44 4424
45 4740
46 5070
47 5415
48 5776
49 6152
50 6544
51 6953
52 7378
53 7820

List of values

[0, 0, 0, 1, 2, 4, 8, 13, 20, 30, 42, 57, 76, 98, 124, 155, 190, 230, 276, 327, 384, 448, 518, 595, 680, 772, 872, 981, 1098, 1224, 1360, 1505, 1660, 1826, 2002, 2189, 2388, 2598, 2820, 3055, 3302, 3562, 3836, 4123, 4424, 4740, 5070, 5415, 5776, 6152, 6544, 6953, 7378, 7820]