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.

A111466 a(1) = 1, a(n+1) = a(n) - F(n+1), if F(n+1) <= a(n), else a(n+1) = a(n) + F(n+1). F(n) is the n-th Fibonacci number (A000045).

Table of values

n a(n)
1 1
2 0
3 2
4 5
5 0
6 8
7 21
8 0
9 34
10 89
11 0
12 144
13 377
14 0
15 610
16 1597
17 0
18 2584
19 6765
20 0
21 10946
22 28657
23 0
24 46368
25 121393
26 0
27 196418
28 514229
29 0
30 832040
31 2178309
32 0
33 3524578
34 9227465
35 0
36 14930352
37 39088169
38 0
39 63245986
40 165580141
41 0
42 267914296
43 701408733
44 0
45 1134903170

List of values

[1, 0, 2, 5, 0, 8, 21, 0, 34, 89, 0, 144, 377, 0, 610, 1597, 0, 2584, 6765, 0, 10946, 28657, 0, 46368, 121393, 0, 196418, 514229, 0, 832040, 2178309, 0, 3524578, 9227465, 0, 14930352, 39088169, 0, 63245986, 165580141, 0, 267914296, 701408733, 0, 1134903170]