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.

A268489 a(n) + f(a(n)) is always odd, where f is the sequence obtained by replacing each term with the corresponding row of A027746 (list of its prime factors). Lexicographic first such sequence without duplicates.

Table of values

n a(n)
1 2
2 1
3 5
4 7
5 4
6 10
7 11
8 13
9 8
10 17
11 14
12 16
13 15
14 19
15 22
16 28
17 27
18 30
19 34
20 35
21 36
22 38
23 39
24 42
25 43
26 44
27 46
28 47
29 48
30 50
31 51
32 56
33 57
34 59
35 64
36 66
37 67
38 69
39 70
40 72
41 75
42 77
43 79
44 82
45 84
46 88
47 89
48 91
49 92
50 94
51 96
52 98
53 103
54 104
55 107
56 110
57 112
58 113
59 119
60 121
61 126
62 129
63 132

List of values

[2, 1, 5, 7, 4, 10, 11, 13, 8, 17, 14, 16, 15, 19, 22, 28, 27, 30, 34, 35, 36, 38, 39, 42, 43, 44, 46, 47, 48, 50, 51, 56, 57, 59, 64, 66, 67, 69, 70, 72, 75, 77, 79, 82, 84, 88, 89, 91, 92, 94, 96, 98, 103, 104, 107, 110, 112, 113, 119, 121, 126, 129, 132]