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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 6
4 24
5 114
6 608
7 3554
8 22480
9 152546
10 1103200
11 8456994
12 68411632
13 581745250
14 5183126016
15 48245682338
16 467988498064
17 4720072211938
18 49400302118560
19 535546012710434
20 6004045485933104
21 69507152958422370
22 829789019700511040
23 10202854323325253538
24 129061753086335478736

List of values

[1, 1, 2, 6, 24, 114, 608, 3554, 22480, 152546, 1103200, 8456994, 68411632, 581745250, 5183126016, 48245682338, 467988498064, 4720072211938, 49400302118560, 535546012710434, 6004045485933104, 69507152958422370, 829789019700511040, 10202854323325253538, 129061753086335478736]