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.

A338458 Least number of heptagonal pyramidal 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 7
22 8
23 9
24 3
25 4
26 1
27 2
28 3
29 4
30 5
31 6
32 4
33 5
34 2
35 3
36 4
37 5
38 6
39 7
40 5
41 6
42 3
43 4
44 5
45 6
46 7
47 8
48 6
49 7
50 4
51 5
52 2
53 3
54 4
55 5
56 6
57 7
58 5
59 6
60 1
61 2
62 3
63 4
64 5
65 6
66 6
67 7
68 2
69 3
70 4
71 5
72 6
73 7
74 7
75 8
76 3
77 4
78 3
79 4
80 5
81 6
82 7
83 8
84 4
85 5
86 2
87 3
88 4
89 5
90 6
91 7
92 5
93 6
94 3
95 4
96 5
97 6
98 7
99 8
100 6
101 7

List of values

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