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.

A261702 a(1) = 1; for n>1, a(n) is the smallest positive integer not already present which is entailed by the rules (i) k present => 2k present; (ii) 3k+1 present and k odd => k present.

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 16
6 5
7 10
8 3
9 6
10 12
11 20
12 24
13 32
14 40
15 13
16 26
17 48
18 52
19 17
20 34
21 11
22 22
23 7
24 14
25 28
26 9
27 18
28 36
29 44
30 56
31 64
32 21
33 42
34 68
35 72
36 80
37 84
38 88
39 29
40 58
41 19
42 38
43 76
44 25
45 50
46 96
47 100
48 33
49 66
50 104
51 112
52 37
53 74
54 116
55 128
56 132
57 136
58 45
59 90
60 144
61 148
62 49
63 98
64 152

List of values

[1, 2, 4, 8, 16, 5, 10, 3, 6, 12, 20, 24, 32, 40, 13, 26, 48, 52, 17, 34, 11, 22, 7, 14, 28, 9, 18, 36, 44, 56, 64, 21, 42, 68, 72, 80, 84, 88, 29, 58, 19, 38, 76, 25, 50, 96, 100, 33, 66, 104, 112, 37, 74, 116, 128, 132, 136, 45, 90, 144, 148, 49, 98, 152]

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

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