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.

A353125 a(1)=2. If a(n) is a novel term, a(n+1) = sopfr(a(n)), else if there are k occurrences of a(j)=a(n), (1<=j<=n), a(n+1)=k*a(n).

Table of values

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

List of values

[2, 2, 4, 4, 8, 6, 5, 5, 10, 7, 7, 14, 9, 6, 12, 7, 21, 10, 20, 9, 18, 8, 16, 8, 24, 9, 27, 9, 36, 10, 30, 10, 40, 11, 11, 22, 13, 13, 26, 15, 8, 32, 10, 50, 12, 24, 48, 11, 33, 14, 28, 11, 44, 15, 30, 60, 12, 36, 72, 12, 48, 96, 13, 39, 16, 32, 64, 12, 60, 120]