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.

A265743 a(n) = number of terms of A005187 needed to sum to n using the greedy algorithm.

Table of values

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

List of values

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

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

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