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.

A323712 Number of the following described shuffles required to return a deck of n cards to its original state. Create two piles by alternating a card from the top of the deck left-right-left-right until the deck is exhausted. Then, placing the left pile on top of the right pile constitutes one shuffle.

Table of values

n a(n)
1 1
2 1
3 3
4 4
5 4
6 6
7 6
8 3
9 9
10 5
11 5
12 12
13 12
14 4
15 12
16 8
17 8
18 9
19 9
20 6
21 6
22 22
23 22
24 20
25 20
26 9
27 27
28 28
29 28
30 10
31 10
32 5
33 15
34 12
35 12
36 36
37 36
38 12
39 12
40 20
41 20
42 7
43 7
44 12
45 36
46 46
47 46
48 42
49 42
50 8
51 24
52 52
53 52
54 20
55 20
56 9
57 9
58 29
59 29
60 60
61 60
62 6
63 18
64 12
65 12
66 33
67 33
68 22
69 66
70 70
71 70
72 18

List of values

[1, 1, 3, 4, 4, 6, 6, 3, 9, 5, 5, 12, 12, 4, 12, 8, 8, 9, 9, 6, 6, 22, 22, 20, 20, 9, 27, 28, 28, 10, 10, 5, 15, 12, 12, 36, 36, 12, 12, 20, 20, 7, 7, 12, 36, 46, 46, 42, 42, 8, 24, 52, 52, 20, 20, 9, 9, 29, 29, 60, 60, 6, 18, 12, 12, 33, 33, 22, 66, 70, 70, 18]

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

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