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.

A023858 a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k = floor((n+1)/2), t = A023531.

Table of values

n a(n)
1 0
2 1
3 2
4 0
5 1
6 2
7 3
8 4
9 6
10 2
11 3
12 4
13 5
14 7
15 9
16 11
17 13
18 5
19 6
20 8
21 10
22 12
23 14
24 16
25 18
26 20
27 23
28 11
29 13
30 15
31 17
32 19
33 21
34 23
35 26
36 29
37 32
38 35
39 38
40 20
41 22
42 24
43 26
44 29
45 32
46 35
47 38
48 41
49 44
50 47
51 50
52 53
53 56
54 32
55 35
56 38
57 41
58 44
59 47
60 50
61 53
62 56
63 59
64 62
65 66
66 70
67 74
68 78
69 82
70 50
71 53
72 56
73 59
74 62
75 65
76 68
77 72
78 76
79 80
80 84
81 88
82 92

List of values

[0, 1, 2, 0, 1, 2, 3, 4, 6, 2, 3, 4, 5, 7, 9, 11, 13, 5, 6, 8, 10, 12, 14, 16, 18, 20, 23, 11, 13, 15, 17, 19, 21, 23, 26, 29, 32, 35, 38, 20, 22, 24, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 66, 70, 74, 78, 82, 50, 53, 56, 59, 62, 65, 68, 72, 76, 80, 84, 88, 92]