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.

A322283 Number of permutations of [n] in which the length of every increasing run is 0 or 1 (mod 10).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 22
12 242
13 2002
14 13442
15 77506
16 397826
17 1862146
18 8085506
19 32978946
20 127758774
21 482490294
22 2015041314
23 13111486674
24 144226353414
25 1835958708870
26 22030803357420
27 240151251989220
28 2389590181956120
29 21944411982069720
30 187919216043135720

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 22, 242, 2002, 13442, 77506, 397826, 1862146, 8085506, 32978946, 127758774, 482490294, 2015041314, 13111486674, 144226353414, 1835958708870, 22030803357420, 240151251989220, 2389590181956120, 21944411982069720, 187919216043135720]