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.

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

Table of values

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

List of values

[1, 0, 0, 1, 2, 3, 4, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 32]