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.

A333907 For n >= 1, a(n) = Sum_{k=1..n} prevfib(k) + nextfib(k) - 2*k, where prevfib(k) is the largest Fibonacci number < k, nextfib(k) is the smallest Fibonacci number > k.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 2
6 3
7 2
8 4
9 7
10 8
11 7
12 4
13 7
14 13
15 17
16 19
17 19
18 17
19 13
20 7
21 12
22 23
23 32
24 39
25 44
26 47
27 48
28 47
29 44
30 39
31 32
32 23
33 12
34 20
35 39
36 56
37 71
38 84
39 95
40 104
41 111
42 116
43 119
44 120
45 119
46 116
47 111
48 104
49 95
50 84
51 71
52 56
53 39
54 20
55 33
56 65
57 95
58 123
59 149
60 173
61 195
62 215
63 233
64 249
65 263
66 275

List of values

[0, 0, 1, 1, 2, 3, 2, 4, 7, 8, 7, 4, 7, 13, 17, 19, 19, 17, 13, 7, 12, 23, 32, 39, 44, 47, 48, 47, 44, 39, 32, 23, 12, 20, 39, 56, 71, 84, 95, 104, 111, 116, 119, 120, 119, 116, 111, 104, 95, 84, 71, 56, 39, 20, 33, 65, 95, 123, 149, 173, 195, 215, 233, 249, 263, 275]