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.

A329423 Each term is visited once according to the rule: go left (resp. right) a(n) places if a(n) is prime (resp. not prime), starting at a(1) = 1. Choose a(n) along this journey as the largest possible prime, or else the smallest possible composite, not occurring earlier and compatible with these rules.

Table of values

n a(n)
1 1
2 4
3 6
4 8
5 9
6 3
7 12
8 14
9 5
10 21
11 25
12 7
13 20
14 10
15 51
16 16
17 26
18 22
19 11
20 15
21 34
22 2
23 28
24 17
25 63
26 42
27 48
28 33
29 36
30 32
31 13
32 18
33 23
34 60
35 19
36 24
37 52
38 91
39 45
40 29
41 69
42 55
43 27
44 39
45 66
46 58
47 116
48 78
49 85
50 37
51 30
52 105
53 94
54 90
55 35
56 75
57 81
58 77
59 112
60 43
61 31
62 41
63 65
64 106
65 38
66 50
67 72
68 44
69 141
70 47
71 133
72 180
73 100
74 150
75 49
76 121
77 168
78 128
79 110

List of values

[1, 4, 6, 8, 9, 3, 12, 14, 5, 21, 25, 7, 20, 10, 51, 16, 26, 22, 11, 15, 34, 2, 28, 17, 63, 42, 48, 33, 36, 32, 13, 18, 23, 60, 19, 24, 52, 91, 45, 29, 69, 55, 27, 39, 66, 58, 116, 78, 85, 37, 30, 105, 94, 90, 35, 75, 81, 77, 112, 43, 31, 41, 65, 106, 38, 50, 72, 44, 141, 47, 133, 180, 100, 150, 49, 121, 168, 128, 110]