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.

A198791 Least count k that deletes the alternate (odd) numbers in the Josephus problem for a circle of numbers 1, 2, 3, ... 2*n, leaving the even numbers undeleted.

Table of values

n a(n)
1 1
2 5
3 19
4 27
5 87
6 989
7 3119
8 5399
9 8189
10 99663
11 57455
12 222397
13 2603047
14 8476649
15 117917347
16 290190179
17 360064247
18 1344262919
19 3181391639
20 39179386959
21 204692414215
22 165424388219
23 2254874520599
24 2922139183443
25 594630799853

List of values

[1, 5, 19, 27, 87, 989, 3119, 5399, 8189, 99663, 57455, 222397, 2603047, 8476649, 117917347, 290190179, 360064247, 1344262919, 3181391639, 39179386959, 204692414215, 165424388219, 2254874520599, 2922139183443, 594630799853]