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.

A385333 The numbers of people such that, in the variant of the Josephus problem in which three people are skipped and then one is eliminated, the last person is the last to be eliminated.

Table of values

n a(n)
1 1
2 21
3 38
4 51
5 122
6 163
7 689
8 919
9 2906
10 3875
11 5167
12 51617
13 68823
14 163137
15 290022
16 1629537
17 6866858
18 9155811
19 16276998
20 28936886
21 38582515
22 121939802
23 162586403
24 216781871
25 289042495
26 513853325
27 685137767
28 913517023
29 2165373685
30 12166489185
31 38452113969
32 121527668842

List of values

[1, 21, 38, 51, 122, 163, 689, 919, 2906, 3875, 5167, 51617, 68823, 163137, 290022, 1629537, 6866858, 9155811, 16276998, 28936886, 38582515, 121939802, 162586403, 216781871, 289042495, 513853325, 685137767, 913517023, 2165373685, 12166489185, 38452113969, 121527668842]