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.

A024476 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Lucas numbers), t = A023533.

Table of values

n a(n)
1 1
2 0
3 0
4 1
5 3
6 4
7 7
8 0
9 0
10 1
11 3
12 4
13 7
14 11
15 18
16 29
17 47
18 76
19 123
20 1
21 3
22 4
23 7
24 11
25 18
26 29
27 47
28 76
29 123
30 199
31 322
32 521
33 843
34 1364
35 2208
36 3574
37 5782
38 9356
39 15138
40 18
41 29
42 47
43 76
44 123
45 199
46 322
47 521
48 843
49 1364
50 2207
51 3571
52 5778
53 9349
54 15127
55 24476
56 39604
57 64082
58 103686
59 167768

List of values

[1, 0, 0, 1, 3, 4, 7, 0, 0, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2208, 3574, 5782, 9356, 15138, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, 15127, 24476, 39604, 64082, 103686, 167768]