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.

A054086 For k >= 1, let p(k)=least h in N not already an a(i), q(k)=p(k)+k, a(3k-1)=q(k), a(3k)=p(k), a(3k+1)=least h in N not already an a(i).

Table of values

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

List of values

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

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

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