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.

A111118 a(1) = 1; skipping over integers occurring earlier in the sequence, count down c(n) (c(n) = n-th composite) from a(n) to get a(n+1). If this is <= 0, instead count up from a(n) c(n) positions (skipping already occurring integers) to get a(n+1).

Table of values

n a(n)
1 1
2 5
3 11
4 2
5 13
6 23
7 9
8 26
9 7
10 28
11 3
12 31
13 52
14 29
15 55
16 25
17 57
18 22
19 59
20 19
21 62
22 17
23 64
24 15
25 66
26 10
27 68
28 6
29 71
30 115
31 69
32 117
33 63
34 119
35 60
36 121
37 56
38 124
39 53
40 126
41 50
42 128
43 47
44 131
45 45
46 133
47 43
48 135
49 40
50 137
51 38
52 140
53 35
54 142
55 33
56 144
57 30
58 147
59 24
60 149
61 18
62 151
63 14
64 153
65 8
66 156

List of values

[1, 5, 11, 2, 13, 23, 9, 26, 7, 28, 3, 31, 52, 29, 55, 25, 57, 22, 59, 19, 62, 17, 64, 15, 66, 10, 68, 6, 71, 115, 69, 117, 63, 119, 60, 121, 56, 124, 53, 126, 50, 128, 47, 131, 45, 133, 43, 135, 40, 137, 38, 140, 35, 142, 33, 144, 30, 147, 24, 149, 18, 151, 14, 153, 8, 156]