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.

A294339 Number of ways to write 2^n as a finite power-tower of positive integers greater than one, allowing both left and right nesting of parentheses.

Table of values

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

List of values

[1, 2, 2, 5, 2, 6, 2, 12, 5, 6, 2, 19, 2, 6, 6, 32, 2, 19, 2, 19, 6, 6, 2, 56, 5, 6, 12, 19, 2, 26, 2, 79, 6, 6, 6, 71, 2, 6, 6, 56, 2, 26, 2, 19, 19, 6, 2, 169, 5, 19, 6, 19, 2, 56, 6, 56, 6, 6, 2, 101, 2, 6, 19, 203, 6, 26, 2, 19, 6, 26, 2, 237, 2, 6, 19, 19]