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.

A109732 a(1) = 1; for n > 1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 2k+1 present; (ii) 3k present => k present.

Table of values

n a(n)
1 1
2 3
3 7
4 15
5 5
6 11
7 23
8 31
9 47
10 63
11 21
12 43
13 87
14 29
15 59
16 95
17 119
18 127
19 175
20 191
21 239
22 255
23 85
24 171
25 57
26 19
27 39
28 13
29 27
30 9
31 55
32 79
33 111
34 37
35 75
36 25
37 51
38 17
39 35
40 71
41 103
42 115
43 143
44 151
45 159
46 53
47 107
48 207
49 69
50 139
51 215
52 223
53 231
54 77
55 155
56 279
57 93
58 187
59 287
60 303
61 101
62 203

List of values

[1, 3, 7, 15, 5, 11, 23, 31, 47, 63, 21, 43, 87, 29, 59, 95, 119, 127, 175, 191, 239, 255, 85, 171, 57, 19, 39, 13, 27, 9, 55, 79, 111, 37, 75, 25, 51, 17, 35, 71, 103, 115, 143, 151, 159, 53, 107, 207, 69, 139, 215, 223, 231, 77, 155, 279, 93, 187, 287, 303, 101, 203]

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

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