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.

A051732 Number of rounds of shuffling required to restore a deck of n cards to its original order: shuffling is done by keeping first card, putting second at end of deck, keeping next, putting next at end and so on.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 5
7 6
8 6
9 4
10 9
11 4
12 28
13 10
14 9
15 14
16 12
17 5
18 70
19 18
20 24
21 10
22 7
23 210
24 126
25 110
26 60
27 26
28 120
29 9
30 29
31 30
32 60
33 6
34 33
35 308
36 42
37 60
38 990
39 30
40 374
41 27
42 41
43 60
44 2618
45 840
46 840
47 420
48 1386
49 24
50 15
51 50
52 644
53 840
54 53
55 18
56 1386
57 14
58 13300
59 2520
60 1260
61 55
62 6930
63 50
64 60
65 7

List of values

[1, 1, 2, 2, 3, 5, 6, 6, 4, 9, 4, 28, 10, 9, 14, 12, 5, 70, 18, 24, 10, 7, 210, 126, 110, 60, 26, 120, 9, 29, 30, 60, 6, 33, 308, 42, 60, 990, 30, 374, 27, 41, 60, 2618, 840, 840, 420, 1386, 24, 15, 50, 644, 840, 53, 18, 1386, 14, 13300, 2520, 1260, 55, 6930, 50, 60, 7]