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.

A019567 Order of the Mongean shuffle permutation of 2n cards: a(n) is least number m for which either 2^m + 1 or 2^m - 1 is divisible by 4n + 1.

Table of values

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

List of values

[1, 2, 3, 6, 4, 6, 10, 14, 5, 18, 10, 12, 21, 26, 9, 30, 6, 22, 9, 30, 27, 8, 11, 10, 24, 50, 12, 18, 14, 12, 55, 50, 7, 18, 34, 46, 14, 74, 24, 26, 33, 20, 78, 86, 29, 90, 18, 18, 48, 98, 33, 10, 45, 70, 15, 24, 60, 38, 29, 78, 12, 84, 41, 110, 8, 84, 26, 134, 12, 46, 35, 36, 68, 146]