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.

A145172 Number of pentagonal numbers needed to represent n with greedy algorithm.

Table of values

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

List of values

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