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.

A324132 Number of permutations of [n] that avoid the shuffle pattern s-k-t, where s = 1 and t = 1234.

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 24
5 120
6 715
7 4946
8 38963
9 344350
10 3374300
11 36309360
12 425630742
13 5398849407
14 73675463140
15 1076309968529
16 16759420085633
17 277094358530356
18 4848092369455556
19 89489787445905318
20 1738016295746132796
21 35427829798218756153
22 756269443056959088424
23 16871986369868627423375

List of values

[1, 1, 2, 6, 24, 120, 715, 4946, 38963, 344350, 3374300, 36309360, 425630742, 5398849407, 73675463140, 1076309968529, 16759420085633, 277094358530356, 4848092369455556, 89489787445905318, 1738016295746132796, 35427829798218756153, 756269443056959088424, 16871986369868627423375]