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.

A024467 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306.

Table of values

n a(n)
1 0
2 1
3 2
4 1
5 3
6 2
7 4
8 7
9 12
10 11
11 19
12 18
13 30
14 28
15 46
16 41
17 67
18 54
19 88
20 142
21 231
22 230
23 373
24 371
25 601
26 596
27 965
28 952
29 1541
30 1507
31 2439
32 2350
33 3803
34 3570
35 5776
36 5166
37 8359
38 6761
39 10940
40 17702
41 28643
42 28635
43 46333
44 46312
45 74935
46 74880
47 121159
48 121015
49 195807
50 195430
51 316213

List of values

[0, 1, 2, 1, 3, 2, 4, 7, 12, 11, 19, 18, 30, 28, 46, 41, 67, 54, 88, 142, 231, 230, 373, 371, 601, 596, 965, 952, 1541, 1507, 2439, 2350, 3803, 3570, 5776, 5166, 8359, 6761, 10940, 17702, 28643, 28635, 46333, 46312, 74935, 74880, 121159, 121015, 195807, 195430, 316213]