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.

A360476 The integers of the sequence appear exactly twice. Between the two copies of k there are k odd integers. The sequence is always extended with the smallest integer not leading to a contradiction.

Table of values

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

List of values

[1, 2, 3, 1, 2, 4, 5, 6, 7, 3, 8, 9, 4, 10, 11, 12, 13, 5, 6, 14, 15, 16, 17, 7, 18, 19, 8, 20, 21, 22, 23, 9, 10, 24, 25, 26, 27, 11, 12, 28, 29, 30, 31, 13, 32, 33, 14, 34, 35, 36, 37, 15, 16, 38, 39, 40, 41, 17, 42, 43, 18, 44, 45, 46, 47, 19, 20, 48, 49, 50]