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.

A023869 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A014306.

Table of values

n a(n)
1 0
2 1
3 3
4 2
5 4
6 3
7 6
8 10
9 15
10 14
11 19
12 18
13 24
14 23
15 30
16 29
17 37
18 36
19 45
20 54
21 64
22 63
23 74
24 73
25 85
26 84
27 97
28 96
29 110
30 109
31 124
32 123
33 139
34 138
35 154
36 152
37 169
38 167
39 185
40 204
41 224
42 223
43 244
44 243
45 265
46 264
47 287
48 286
49 310
50 309
51 334
52 333
53 359
54 358
55 385
56 383
57 410
58 408
59 436
60 434
61 463
62 461
63 491
64 489

List of values

[0, 1, 3, 2, 4, 3, 6, 10, 15, 14, 19, 18, 24, 23, 30, 29, 37, 36, 45, 54, 64, 63, 74, 73, 85, 84, 97, 96, 110, 109, 124, 123, 139, 138, 154, 152, 169, 167, 185, 204, 224, 223, 244, 243, 265, 264, 287, 286, 310, 309, 334, 333, 359, 358, 385, 383, 410, 408, 436, 434, 463, 461, 491, 489]