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.

A385327 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 first person is the last to be eliminated.

Table of values

n a(n)
1 1
2 2
3 5
4 9
5 12
6 16
7 218
8 517
9 1226
10 6890
11 12249
12 16332
13 21776
14 38713
15 122353
16 687461
17 1222153
18 51443354
19 385389994
20 1218022698
21 1624030264
22 2887164914
23 5132737625
24 9124866889
25 28839085477
26 162036891790
27 910429504490
28 2877406829006
29 5115389918233
30 510385736583765

List of values

[1, 2, 5, 9, 12, 16, 218, 517, 1226, 6890, 12249, 16332, 21776, 38713, 122353, 687461, 1222153, 51443354, 385389994, 1218022698, 1624030264, 2887164914, 5132737625, 9124866889, 28839085477, 162036891790, 910429504490, 2877406829006, 5115389918233, 510385736583765]

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

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