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.

A054084 Permutation of N: for each k >= 1, let p(k)=least natural number not already an a(i), q(k)=p(k)+k, a(2k-1)=q(k), a(2k)=p(k).

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.