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.

A338480 Least number of heptagonal numbers needed to represent n.

Table of values

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

List of values

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