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.

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

Table of values

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

List of values

[1, 0, 2, 0, 2, 1, 3, 0, 3, 1, 3, 2, 4, 0, 4, 1, 4, 2, 4, 3, 5, 0, 5, 1, 5, 2, 5, 3, 5, 4, 6, 0, 6, 1, 6, 2, 6, 3, 6, 4, 6, 5, 7, 0, 7, 1, 7, 2, 7, 3, 7, 4, 7, 5, 7, 6, 8, 0, 8, 1, 8, 2, 8, 3, 8, 4, 8, 5, 8, 6, 8, 7, 9, 0, 9, 1, 9, 2, 9, 3, 9, 4, 9, 5, 9, 6, 9, 7, 9, 8, 10, 0, 10, 1, 10, 2, 10, 3, 10, 4, 10, 5, 10, 6, 10, 7, 10, 8, 10, 9, 11, 0, 11, 1, 11, 2, 11, 3, 11, 4]