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.

A339107 a(1) = 3; for n>1, a(n) = the smallest positive number not occurring earlier such that a(n-1)*a(n) is divisible by a(n-1)+a(n), where a(n) is not a prime or 4.

Table of values

n a(n)
1 3
2 6
3 12
4 24
5 8
6 56
7 42
8 21
9 28
10 70
11 30
12 15
13 10
14 40
15 60
16 20
17 80
18 48
19 16
20 112
21 84
22 14
23 35
24 140
25 105
26 120
27 72
28 9
29 18
30 36
31 45
32 90
33 135
34 108
35 54
36 27
37 216
38 270
39 180
40 144
41 240
42 160
43 96
44 32
45 224
46 168
47 126
48 63
49 378
50 189
51 252
52 315
53 210
54 231
55 132
56 44
57 77
58 462
59 22
60 99
61 198
62 165
63 110
64 374
65 204
66 68
67 221
68 2652

List of values

[3, 6, 12, 24, 8, 56, 42, 21, 28, 70, 30, 15, 10, 40, 60, 20, 80, 48, 16, 112, 84, 14, 35, 140, 105, 120, 72, 9, 18, 36, 45, 90, 135, 108, 54, 27, 216, 270, 180, 144, 240, 160, 96, 32, 224, 168, 126, 63, 378, 189, 252, 315, 210, 231, 132, 44, 77, 462, 22, 99, 198, 165, 110, 374, 204, 68, 221, 2652]