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.

A363083 a(0)=a(1)=1. For n>1, if the number of occurrences of a(n-1) is less than abs(a(n-1)), then a(n)=a(n-1)-a(n-2). Otherwise, a(n)=a(n-1)+a(n-2).

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 3
5 2
6 5
7 3
8 -2
9 -5
10 -3
11 2
12 -1
13 1
14 0
15 1
16 1
17 2
18 3
19 5
20 2
21 7
22 5
23 -2
24 3
25 1
26 4
27 3
28 7
29 4
30 -3
31 -7
32 -4
33 3
34 -1
35 2
36 1
37 3
38 4
39 1
40 5
41 4
42 9
43 5
44 14
45 9
46 -5
47 -14
48 -9
49 5
50 -4
51 -9
52 -5
53 4
54 -1
55 3
56 2
57 5
58 7
59 2
60 9
61 7
62 -2
63 5
64 3
65 8
66 5
67 13
68 8
69 -5
70 -13
71 -8
72 5
73 -3
74 2
75 -1
76 1
77 0

List of values

[1, 1, 2, 1, 3, 2, 5, 3, -2, -5, -3, 2, -1, 1, 0, 1, 1, 2, 3, 5, 2, 7, 5, -2, 3, 1, 4, 3, 7, 4, -3, -7, -4, 3, -1, 2, 1, 3, 4, 1, 5, 4, 9, 5, 14, 9, -5, -14, -9, 5, -4, -9, -5, 4, -1, 3, 2, 5, 7, 2, 9, 7, -2, 5, 3, 8, 5, 13, 8, -5, -13, -8, 5, -3, 2, -1, 1, 0]