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.

A363159 a(1)=1. Thereafter, if a(n-1) is a novel term, a(n) is the smallest prime which does not divide a(n-1). If a(n-1) has been seen k (>1) times already then a(n) = k*a(n-1).

Table of values

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

List of values

[1, 2, 3, 2, 4, 3, 6, 5, 2, 6, 12, 5, 10, 3, 9, 2, 8, 3, 12, 24, 5, 15, 2, 10, 20, 3, 15, 30, 7, 2, 12, 36, 5, 20, 40, 3, 18, 5, 25, 2, 14, 3, 21, 2, 16, 3, 24, 48, 5, 30, 60, 7, 14, 28, 3, 27, 2, 18, 36, 72, 5, 35, 2, 20, 60, 120, 7, 21, 42, 5, 40, 80, 3, 30, 90, 7, 28, 56, 3, 33, 2, 22, 3, 36, 108]