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.

A325597 a(n) is the least number not 2a(m) + a(m-1) for any m < n.

Table of values

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

List of values

[1, 2, 3, 4, 6, 7, 9, 10, 12, 13, 14, 15, 17, 18, 19, 21, 22, 23, 24, 26, 27, 28, 30, 31, 32, 33, 35, 36, 37, 39, 40, 42, 43, 45, 46, 47, 48, 50, 51, 52, 54, 55, 57, 58, 59, 60, 62, 63, 64, 66, 67, 69, 70, 72, 73, 74, 75, 77, 78, 79, 81, 82, 84, 85, 86, 87]