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.

A024595 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (F(2), F(3), ...), t = A023533.

Table of values

n a(n)
1 1
2 0
3 0
4 1
5 2
6 3
7 5
8 0
9 0
10 1
11 2
12 3
13 5
14 8
15 13
16 21
17 34
18 55
19 89
20 1
21 2
22 3
23 5
24 8
25 13
26 21
27 34
28 55
29 89
30 144
31 233
32 377
33 610
34 987
35 1598
36 2586
37 4184
38 6770
39 10954
40 13
41 21
42 34
43 55
44 89
45 144
46 233
47 377
48 610
49 987
50 1597
51 2584
52 4181
53 6765
54 10946
55 17711
56 28658
57 46370
58 75028
59 121398
60 196426

List of values

[1, 0, 0, 1, 2, 3, 5, 0, 0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1598, 2586, 4184, 6770, 10954, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28658, 46370, 75028, 121398, 196426]