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.

A328483 Maximum number of times any term appears when n is expressed as a greedy sum of terms of A129912 (maximal digit when n is expressed in greedy A129912-base).

Table of values

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

List of values

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