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.

A167047 Angry numbers: each number n must be more than n places from n-1 and n+1. This sequence makes each number as small as possible as it occurs.

Table of values

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

List of values

[1, 3, 5, 7, 9, 2, 11, 13, 4, 15, 17, 6, 19, 21, 8, 23, 25, 27, 10, 29, 31, 12, 33, 35, 37, 14, 39, 41, 16, 43, 45, 47, 18, 49, 51, 20, 53, 55, 57, 22, 59, 61, 24, 63, 65, 26, 67, 69, 71, 28, 73, 75, 30, 77, 79, 81, 32, 83, 85, 34, 87, 89, 36, 91, 93, 95, 38, 97, 99, 40, 101, 103]