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.

A289386 Number of rounds of 'deal one, skip one' shuffling required to return a deck of n cards to its original order.

Table of values

n a(n)
1 1
2 2
3 3
4 2
5 5
6 6
7 5
8 4
9 6
10 6
11 15
12 12
13 12
14 30
15 15
16 4
17 17
18 18
19 10
20 20
21 21
22 14
23 24
24 90
25 63
26 26
27 27
28 18
29 66
30 12
31 210
32 12
33 33
34 90
35 35
36 30
37 110
38 120
39 120
40 26
41 41
42 42
43 105
44 30
45 45
46 30
47 60
48 48
49 120
50 50
51 42
52 510
53 53
54 1680
55 120
56 1584
57 57
58 336
59 276
60 60
61 2665
62 720
63 8415

List of values

[1, 2, 3, 2, 5, 6, 5, 4, 6, 6, 15, 12, 12, 30, 15, 4, 17, 18, 10, 20, 21, 14, 24, 90, 63, 26, 27, 18, 66, 12, 210, 12, 33, 90, 35, 30, 110, 120, 120, 26, 41, 42, 105, 30, 45, 30, 60, 48, 120, 50, 42, 510, 53, 1680, 120, 1584, 57, 336, 276, 60, 2665, 720, 8415]