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.

A327759 a(1) = 1; a(2) = 2; a(n) = n - max{k a(k) = m(n)}, where m(n) is the largest term so far if a(n-1) is odd, the second largest term so far if a(n-1) is even.

Table of values

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

List of values

[1, 2, 2, 3, 1, 2, 1, 4, 5, 1, 2, 4, 1, 5, 1, 2, 5, 1, 2, 8, 4, 5, 3, 4, 3, 6, 1, 8, 3, 2, 5, 4, 7, 6, 2, 3, 9, 1, 2, 12, 4, 5, 3, 4, 8, 9, 7, 8, 3, 10, 1, 12, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10, 2, 3, 13, 1, 2, 16, 4, 5, 3, 4, 8, 9, 7, 8, 12, 13, 11, 12, 3]