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.

A381902 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest unused positive number such that a(n) shares a factor with a(n-1), while the total number of prime factors, counted with multiplicity, of the form 4*k+1 and 4*k+3 for all terms a(1)..a(n) never differs by more than 1.

Table of values

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

List of values

[1, 2, 4, 6, 8, 10, 5, 15, 3, 12, 16, 20, 14, 26, 13, 39, 9, 30, 25, 35, 7, 28, 32, 34, 17, 51, 18, 40, 22, 50, 24, 38, 52, 44, 55, 60, 58, 29, 87, 21, 70, 64, 68, 46, 74, 37, 111, 33, 75, 45, 65, 78, 36, 80, 48, 82, 41, 123, 42, 91, 104, 56, 100, 62, 31]