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.

A319855 Minimum number that can be obtained by iteratively adding or multiplying together parts of the integer partition with Heinz number n until only one part remains.

Table of values

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

List of values

[0, 1, 2, 1, 3, 2, 4, 1, 4, 3, 5, 2, 6, 4, 5, 1, 7, 4, 8, 3, 6, 5, 9, 2, 6, 6, 6, 4, 10, 5, 11, 1, 7, 7, 7, 4, 12, 8, 8, 3, 13, 6, 14, 5, 7, 9, 15, 2, 8, 6, 9, 6, 16, 6, 8, 4, 10, 10, 17, 5, 18, 11, 8, 1, 9, 7, 19, 7, 11, 7, 20, 4, 21, 12, 8, 8, 9, 8, 22, 3, 8]