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.

A117386 Positive integers, each occurring twice in the sequence, such that a(n) = a(k) when n+k = 6*a(n), starting with a(1)=1 and filling the next vacant position with the smallest unused number.

Table of values

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

List of values

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