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.

A048782 Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.

Table of values

n a(n)
1 1
2 1
3 2
4 6
5 10
6 84
7 70
8 24
9 36
10 330
11 210
12 288
13 1428
14 252
15 10080
16 13680
17 1260
18 19320
19 2160
20 22440
21 1692152
22 50400
23 140760
24 3071880
25 284088
26 608753236
27 617760
28 15600
29 35287560
30 214138080
31 30240
32 1866600
33 58333800
34 8637552
35 4034916600

List of values

[1, 1, 2, 6, 10, 84, 70, 24, 36, 330, 210, 288, 1428, 252, 10080, 13680, 1260, 19320, 2160, 22440, 1692152, 50400, 140760, 3071880, 284088, 608753236, 617760, 15600, 35287560, 214138080, 30240, 1866600, 58333800, 8637552, 4034916600]