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.

A341737 a(n) is the number of segments necessary to represent n in the Cistercian numeral system.

Table of values

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

List of values

[1, 2, 2, 2, 2, 3, 2, 3, 3, 4, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 2, 3, 2, 3, 3, 4, 3, 4, 3, 4, 2, 3, 3, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 3, 3, 4, 3, 4, 4, 5, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 2, 3, 3, 3, 3, 4, 3, 4, 4, 5, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 3, 4, 3, 4, 4, 5, 4]