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.

A338526 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] without consecutive adjacent values.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 0
6 1
7 3
8 2
9 0
10 1
11 4
12 6
13 4
14 2
15 1
16 5
17 12
18 18
19 20
20 14
21 1
22 6
23 20
24 48
25 90
26 124
27 90
28 1
29 7
30 30
31 100
32 272
33 582
34 860
35 646
36 1
37 8
38 42
39 180
40 650
41 1928
42 4386
43 6748
44 5242
45 1
46 9
47 56
48 294
49 1332
50 5110
51 15912
52 37566
53 59612
54 47622
55 1
56 10
57 72
58 448
59 2450
60 11604
61 46250
62 148648
63 360642
64 586540
65 479306

List of values

[1, 1, 1, 1, 2, 0, 1, 3, 2, 0, 1, 4, 6, 4, 2, 1, 5, 12, 18, 20, 14, 1, 6, 20, 48, 90, 124, 90, 1, 7, 30, 100, 272, 582, 860, 646, 1, 8, 42, 180, 650, 1928, 4386, 6748, 5242, 1, 9, 56, 294, 1332, 5110, 15912, 37566, 59612, 47622, 1, 10, 72, 448, 2450, 11604, 46250, 148648, 360642, 586540, 479306]