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.

A221564 The number of FO4C3 moves required to restore a packet of n playing cards to its original state (order and orientation), where each move Flips Over the top four (4) as a unit and then Cuts three (3) cards from the top to bottom.

Table of values

n a(n)
4 2
5 4
6 4
7 4
8 12
9 12
10 6
11 24
12 24
13 8
14 40
15 40
16 10
17 60
18 60
19 12
20 84
21 84
22 14
23 112
24 112
25 16
26 144
27 144
28 18
29 180
30 180
31 20
32 220
33 220
34 22
35 264
36 264
37 24
38 312
39 312
40 26
41 364
42 364
43 28
44 420
45 420
46 30
47 480
48 480
49 32
50 544
51 544
52 34
53 612
54 612
55 36
56 684
57 684
58 38
59 760
60 760
61 40
62 840
63 840

List of values

[2, 4, 4, 4, 12, 12, 6, 24, 24, 8, 40, 40, 10, 60, 60, 12, 84, 84, 14, 112, 112, 16, 144, 144, 18, 180, 180, 20, 220, 220, 22, 264, 264, 24, 312, 312, 26, 364, 364, 28, 420, 420, 30, 480, 480, 32, 544, 544, 34, 612, 612, 36, 684, 684, 38, 760, 760, 40, 840, 840]

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

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