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.

A180200 a(0)=0, a(1)=1; for n > 1, a(n) = 2*m + 1 - (n mod 2 + m mod 2) mod 2, where m = a(floor(n/2)).

Table of values

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

List of values

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

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

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