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.

A385970 a(n) is the minimum number of powers needed to obtain the n-th term of sequence A385969.

Table of values

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

List of values

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