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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 24
5 116
6 652
7 4178
8 30070
9 240164
10 2107606
11 20156458
12 208639514
13 2323794632
14 27709659880
15 352203163790
16 4753474785808
17 67889631514128
18 1022936113573148
19 16216615869916570
20 269816176058513398
21 4701111255106851632
22 85599799432794431978
23 1625828159969984754538

List of values

[1, 1, 2, 6, 24, 116, 652, 4178, 30070, 240164, 2107606, 20156458, 208639514, 2323794632, 27709659880, 352203163790, 4753474785808, 67889631514128, 1022936113573148, 16216615869916570, 269816176058513398, 4701111255106851632, 85599799432794431978, 1625828159969984754538]