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.

A319907 Number of distinct integers that can be obtained by iteratively adding any two or multiplying any two non-1 parts of an integer partition until only one part remains, starting with the integer partition with Heinz number n.

Table of values

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

List of values

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