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.

A023859 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2), and t = A023532.

Table of values

n a(n)
1 1
2 0
3 1
4 3
5 5
6 4
7 7
8 6
9 9
10 13
11 18
12 17
13 23
14 21
15 27
16 25
17 32
18 40
19 49
20 47
21 56
22 54
23 64
24 62
25 73
26 71
27 82
28 94
29 107
30 105
31 119
32 117
33 132
34 130
35 145
36 142
37 158
38 155
39 172
40 190
41 209
42 207
43 227
44 224
45 244
46 241
47 262
48 259
49 281
50 278
51 301
52 298
53 322
54 346
55 371
56 368
57 394
58 391
59 418
60 415
61 443
62 440
63 469
64 466

List of values

[1, 0, 1, 3, 5, 4, 7, 6, 9, 13, 18, 17, 23, 21, 27, 25, 32, 40, 49, 47, 56, 54, 64, 62, 73, 71, 82, 94, 107, 105, 119, 117, 132, 130, 145, 142, 158, 155, 172, 190, 209, 207, 227, 224, 244, 241, 262, 259, 281, 278, 301, 298, 322, 346, 371, 368, 394, 391, 418, 415, 443, 440, 469, 466]