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.

A376548 a(1)=1,a(2)=2. Let p be the smallest prime factor of j=a(n-1), then for n>2 a(n) is the smallest novel multiple of Sopfr(j) if j is in A046363, or of p if it is not.

Table of values

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

List of values

[1, 2, 4, 6, 5, 10, 7, 14, 8, 12, 21, 3, 9, 15, 18, 16, 20, 22, 13, 26, 24, 28, 11, 33, 27, 30, 32, 34, 19, 38, 36, 40, 44, 42, 46, 48, 55, 25, 35, 45, 66, 50, 52, 17, 51, 39, 54, 77, 49, 56, 65, 60, 58, 31, 62, 64, 68, 70, 72, 74, 76, 23, 69, 57, 63, 78, 80, 91]