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.

A358488 a(1) = 1, a(2) = 2. Thereafter a(n) is least novel m satisfying: 1. If i = a(n-2) and j = a(n-1) are closed, choose m closed to i and open to j. 2. If i and j are open, choose m closed to h = a(n-3) and open to i + j, unless such a solution does not exist, in which case the constraint that m is closed to h is dropped, leaving a(n) as least novel m open to i + j. See comments.

Table of values

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

List of values

[1, 2, 4, 3, 9, 15, 8, 14, 11, 33, 55, 6, 12, 16, 7, 21, 35, 10, 5, 18, 22, 24, 23, 115, 161, 20, 25, 27, 36, 28, 26, 30, 32, 31, 93, 155, 34, 17, 39, 13, 38, 19, 42, 40, 41, 123, 287, 44, 46, 45, 51, 57, 52, 50, 56, 53, 159, 265, 48, 54, 58, 49, 63, 77, 60, 62]

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

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