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.

A316437 Take the integer partition with Heinz number n, divide all parts by the GCD of the parts, then take the Heinz number of the resulting partition.

Table of values

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

List of values

[1, 2, 2, 4, 2, 6, 2, 8, 4, 10, 2, 12, 2, 14, 15, 16, 2, 18, 2, 20, 6, 22, 2, 24, 4, 26, 8, 28, 2, 30, 2, 32, 33, 34, 35, 36, 2, 38, 10, 40, 2, 42, 2, 44, 45, 46, 2, 48, 4, 50, 51, 52, 2, 54, 55, 56, 14, 58, 2, 60, 2, 62, 12, 64, 6, 66, 2, 68, 69, 70, 2, 72, 2, 74, 75, 76, 77, 78, 2, 80, 16, 82, 2, 84, 85, 86, 22, 88, 2, 90, 15]