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.

A024222 Number of shuffles (perfect faro shuffles with cut) required to return a deck of size n to its original order.

Table of values

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

List of values

[0, 1, 2, 2, 4, 4, 3, 3, 6, 6, 10, 10, 12, 12, 4, 4, 8, 8, 18, 18, 6, 6, 11, 11, 20, 20, 18, 18, 28, 28, 5, 5, 10, 10, 12, 12, 36, 36, 12, 12, 20, 20, 14, 14, 12, 12, 23, 23, 21, 21, 8, 8, 52, 52, 20, 20, 18, 18, 58, 58, 60, 60, 6, 6, 12, 12, 66, 66, 22, 22, 35, 35, 9, 9, 20, 20]

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

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