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.

A194849 Write n = C(i,3)+C(j,2)+C(k,1) with i>j>k>=0; let L[n] = [i,j,k]; sequence gives list of triples L[n], n >= 0.

Table of values

n a(n)
0 2
1 1
2 0
3 3
4 1
5 0
6 3
7 2
8 0
9 3
10 2
11 1
12 4
13 1
14 0
15 4
16 2
17 0
18 4
19 2
20 1
21 4
22 3
23 0
24 4
25 3
26 1
27 4
28 3
29 2
30 5
31 1
32 0
33 5
34 2
35 0
36 5
37 2
38 1
39 5
40 3
41 0
42 5
43 3
44 1
45 5
46 3
47 2
48 5
49 4
50 0
51 5
52 4
53 1
54 5
55 4
56 2
57 5
58 4
59 3
60 6
61 1
62 0
63 6
64 2
65 0
66 6
67 2
68 1
69 6
70 3
71 0
72 6
73 3
74 1
75 6
76 3
77 2
78 6
79 4
80 0
81 6
82 4
83 1
84 6
85 4
86 2
87 6
88 4
89 3
90 6
91 5
92 0
93 6
94 5
95 1
96 6
97 5
98 2
99 6
100 5
101 3
102 6
103 5
104 4
105 7
106 1
107 0
108 7
109 2
110 0
111 7
112 2
113 1
114 7
115 3
116 0
117 7
118 3
119 1
120 7
121 3
122 2
123 7
124 4

List of values

[2, 1, 0, 3, 1, 0, 3, 2, 0, 3, 2, 1, 4, 1, 0, 4, 2, 0, 4, 2, 1, 4, 3, 0, 4, 3, 1, 4, 3, 2, 5, 1, 0, 5, 2, 0, 5, 2, 1, 5, 3, 0, 5, 3, 1, 5, 3, 2, 5, 4, 0, 5, 4, 1, 5, 4, 2, 5, 4, 3, 6, 1, 0, 6, 2, 0, 6, 2, 1, 6, 3, 0, 6, 3, 1, 6, 3, 2, 6, 4, 0, 6, 4, 1, 6, 4, 2, 6, 4, 3, 6, 5, 0, 6, 5, 1, 6, 5, 2, 6, 5, 3, 6, 5, 4, 7, 1, 0, 7, 2, 0, 7, 2, 1, 7, 3, 0, 7, 3, 1, 7, 3, 2, 7, 4]