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.

A113648 A variant of Josephus Problem in which 2 persons are to be eliminated at the same time.

Table of values

n a(n)
1 1
2 3
3 6
4 1
5 3
6 5
7 7
8 9
9 12
10 15
11 18
12 21
13 24
14 27
15 30
16 1
17 3
18 5
19 7
20 9
21 11
22 13
23 15
24 17
25 19
26 21
27 23
28 25
29 27
30 29
31 31
32 33
33 36
34 39
35 42
36 45
37 48
38 51
39 54
40 57
41 60
42 63
43 66
44 69
45 72
46 75
47 78
48 81
49 84
50 87
51 90
52 93
53 96
54 99
55 102
56 105
57 108
58 111
59 114
60 117
61 120
62 123
63 126
64 1
65 3
66 5
67 7

List of values

[1, 3, 6, 1, 3, 5, 7, 9, 12, 15, 18, 21, 24, 27, 30, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 1, 3, 5, 7]