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.

A276332 a(n) = number of terms of A001563 needed to sum to n when always choosing the largest term that divides the remaining n, a(0) = 0.

Table of values

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

List of values

[0, 1, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 1, 2, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 10, 11, 2, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 3, 4, 7, 8, 9, 10, 8, 9, 10, 11, 9, 10, 11, 12, 10, 11, 12, 13, 4, 5, 6, 7, 5, 6, 7, 8, 6, 7, 8, 9, 7, 8, 9, 10, 8, 9, 5, 6, 9, 10, 11, 12, 1]