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.

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

Table of values

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

List of values

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