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.

A159615 The slowest increasing sequence beginning with a(1)=2 such that a(n) and n are both odious or both not odious.

Table of values

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

List of values

[2, 4, 5, 7, 9, 10, 11, 13, 15, 17, 19, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 97, 99, 101, 103, 105, 107, 109, 111]

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

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