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.

A092332 For S a string of numbers, let F(S) = the product of those numbers. Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.

Table of values

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

List of values

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