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.

A325384 Lexicographically earliest sequence such that for all i, j, a(i) = a(j) => f(i) = f(j) where f(n) = [A000203(n), A009194(n)] for all other numbers, except f(p) = 0 for odd primes.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 3
6 5
7 3
8 6
9 7
10 8
11 3
12 9
13 3
14 10
15 11
16 12
17 3
18 13
19 3
20 14
21 15
22 16
23 3
24 17
25 12
26 14
27 18
28 19
29 3
30 20
31 3
32 21
33 22
34 23
35 24
36 25
37 3
38 26
39 27
40 28
41 3
42 29
43 3
44 30
45 31
46 32
47 3
48 33
49 34
50 35
51 36
52 37
53 3
54 38
55 39
56 40
57 41
58 42
59 3
60 43
61 3
62 44
63 45
64 46
65 47
66 48
67 3
68 49
69 50
70 51
71 3
72 52
73 3
74 53
75 54
76 55
77 56
78 57
79 3
80 58
81 59
82 49
83 3
84 60
85 61
86 62
87 63
88 64
89 3
90 65
91 66
92 67
93 68
94 51
95 69
96 70
97 3
98 71

List of values

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