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.

A338481 Least number of octagonal numbers needed to represent n.

Table of values

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

List of values

[1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 1, 2, 3, 3, 4, 5, 6, 7, 2, 3, 4, 4, 5, 6, 7, 8, 3, 4, 5, 1, 2, 2, 3, 4, 4, 5, 6, 2, 3, 3, 4, 5, 5, 6, 7, 3, 4, 4, 5, 6, 2, 3, 3, 4, 1, 2, 3, 4, 3, 4, 4, 5, 2, 3, 4, 5, 4, 5, 5, 2, 3, 3, 4, 4, 5, 2, 3, 3, 4, 4, 5, 5, 6, 3, 4, 1, 2, 3, 4, 5, 3]