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.

A384276 a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest unused positive number that is coprime to 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 3
4 4
5 5
6 6
7 13
8 7
9 8
10 15
11 16
12 17
13 10
14 9
15 20
16 11
17 25
18 12
19 19
20 26
21 23
22 29
23 14
24 37
25 22
26 35
27 32
28 39
29 34
30 31
31 30
32 41
33 24
34 53
35 28
36 51
37 40
38 43
39 50
40 21
41 52
42 45
43 58
44 47
45 55
46 61
47 38
48 65
49 18
50 73
51 44
52 75
53 46
54 85
55 33
56 64
57 87
58 68
59 59
60 60
61 89
62 48
63 91
64 74
65 67
66 70

List of values

[1, 2, 3, 4, 5, 6, 13, 7, 8, 15, 16, 17, 10, 9, 20, 11, 25, 12, 19, 26, 23, 29, 14, 37, 22, 35, 32, 39, 34, 31, 30, 41, 24, 53, 28, 51, 40, 43, 50, 21, 52, 45, 58, 47, 55, 61, 38, 65, 18, 73, 44, 75, 46, 85, 33, 64, 87, 68, 59, 60, 89, 48, 91, 74, 67, 70]