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.

A374966 a(n) = 0 if n has appeared in the sequence before, otherwise a(n) = a(n-1) + n. Start with a(0) = 0.

Table of values

n a(n)
0 0
1 1
2 3
3 0
4 4
5 9
6 15
7 22
8 30
9 0
10 10
11 21
12 33
13 46
14 60
15 0
16 16
17 33
18 51
19 70
20 90
21 0
22 0
23 23
24 47
25 72
26 98
27 125
28 153
29 182
30 0
31 31
32 63
33 0
34 34
35 69
36 105
37 142
38 180
39 219
40 259
41 300
42 342
43 385
44 429
45 474
46 0
47 0
48 48
49 97
50 147
51 0
52 52
53 105
54 159
55 214
56 270
57 327
58 385
59 444
60 0
61 61
62 123
63 0
64 64
65 129
66 195
67 262
68 330
69 0
70 0

List of values

[0, 1, 3, 0, 4, 9, 15, 22, 30, 0, 10, 21, 33, 46, 60, 0, 16, 33, 51, 70, 90, 0, 0, 23, 47, 72, 98, 125, 153, 182, 0, 31, 63, 0, 34, 69, 105, 142, 180, 219, 259, 300, 342, 385, 429, 474, 0, 0, 48, 97, 147, 0, 52, 105, 159, 214, 270, 327, 385, 444, 0, 61, 123, 0, 64, 129, 195, 262, 330, 0, 0]