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.

A110345 a(n) = n + (n+1) + (n+2) + ... n terms if n is odd, else a(n) = n + (n-1) + (n-2) + ... n terms = n(n+1)/2 = n-th triangular number if n is even.

Table of values

n a(n)
1 1
2 3
3 12
4 10
5 35
6 21
7 70
8 36
9 117
10 55
11 176
12 78
13 247
14 105
15 330
16 136
17 425
18 171
19 532
20 210
21 651
22 253
23 782
24 300
25 925
26 351
27 1080
28 406
29 1247
30 465
31 1426
32 528
33 1617
34 595
35 1820
36 666
37 2035
38 741
39 2262
40 820
41 2501
42 903
43 2752
44 990
45 3015
46 1081
47 3290
48 1176
49 3577
50 1275
51 3876
52 1378

List of values

[1, 3, 12, 10, 35, 21, 70, 36, 117, 55, 176, 78, 247, 105, 330, 136, 425, 171, 532, 210, 651, 253, 782, 300, 925, 351, 1080, 406, 1247, 465, 1426, 528, 1617, 595, 1820, 666, 2035, 741, 2262, 820, 2501, 903, 2752, 990, 3015, 1081, 3290, 1176, 3577, 1275, 3876, 1378]