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.

A381139 a(1) = 1, a(2) = 2. Let j = a(n-1) and let d = A160995(j) be the smallest non-divisor of j which shares a prime factor with j. Then for n > 2 a(n) is the smallest multiple of d which is not yet in the sequence.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 8
6 12
7 16
8 18
9 20
10 24
11 9
12 30
13 28
14 36
15 32
16 42
17 40
18 48
19 27
20 54
21 44
22 60
23 56
24 66
25 52
26 72
27 10
28 64
29 78
30 68
31 84
32 80
33 90
34 76
35 96
36 45
37 102
38 88
39 108
40 104
41 114
42 92
43 120
44 63
45 126
46 100
47 132
48 112
49 138
50 116
51 144
52 50
53 124
54 150
55 128
56 156
57 136
58 162
59 140
60 168
61 81
62 174

List of values

[1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 9, 30, 28, 36, 32, 42, 40, 48, 27, 54, 44, 60, 56, 66, 52, 72, 10, 64, 78, 68, 84, 80, 90, 76, 96, 45, 102, 88, 108, 104, 114, 92, 120, 63, 126, 100, 132, 112, 138, 116, 144, 50, 124, 150, 128, 156, 136, 162, 140, 168, 81, 174]