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.

A120229 Split-floor-multiplier sequence (SFMS) using multipliers 1/3 and 3. The SFMS using multipliers r and s is here introduced: for every positive integer n and positive real number r, let [rn] abbreviate floor(rn). Then SFMS(r, s), where max {r, s} > 1, is the sequence a defined by a(n)=[rn] if [rn] > 0 and is not already in a and a(n) = [sn] otherwise.

Table of values

n a(n)
1 3
2 6
3 1
4 12
5 15
6 2
7 21
8 24
9 27
10 30
11 33
12 4
13 39
14 42
15 5
16 48
17 51
18 54
19 57
20 60
21 7
22 66
23 69
24 8
25 75
26 78
27 9
28 84
29 87
30 10
31 93
32 96
33 11
34 102
35 105
36 108
37 111
38 114
39 13
40 120
41 123
42 14
43 129
44 132
45 135
46 138
47 141
48 16
49 147
50 150
51 17
52 156
53 159
54 18
55 165
56 168
57 19
58 174
59 177
60 20
61 183
62 186
63 189
64 192
65 195

List of values

[3, 6, 1, 12, 15, 2, 21, 24, 27, 30, 33, 4, 39, 42, 5, 48, 51, 54, 57, 60, 7, 66, 69, 8, 75, 78, 9, 84, 87, 10, 93, 96, 11, 102, 105, 108, 111, 114, 13, 120, 123, 14, 129, 132, 135, 138, 141, 16, 147, 150, 17, 156, 159, 18, 165, 168, 19, 174, 177, 20, 183, 186, 189, 192, 195]