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.

A259570 Smallest m such that A259565(m) = 2*n-1.

Table of values

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

List of values

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