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.

A368594 Number of Lucas numbers needed to get n by addition and subtraction.

Table of values

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

List of values

[0, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.