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.

A386583 Triangle read by rows where T(n,k) is the number of length k integer partitions of n having a permutation without any adjacent equal parts (separable).

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 1
5 0
6 0
7 1
8 1
9 0
10 0
11 1
12 1
13 1
14 0
15 0
16 1
17 2
18 2
19 0
20 0
21 0
22 1
23 2
24 2
25 1
26 0
27 0
28 0
29 1
30 3
31 4
32 1
33 1
34 0
35 0
36 0
37 1
38 3
39 5
40 3
41 2
42 0
43 0
44 0
45 0
46 1
47 4
48 6
49 4
50 3
51 1
52 0
53 0
54 0
55 0
56 1
57 4
58 8
59 6
60 5
61 1
62 1
63 0
64 0
65 0
66 0
67 1
68 5
69 10
70 8
71 8
72 3
73 2
74 0
75 0
76 0
77 0
78 0
79 1
80 5
81 11
82 12
83 11
84 5
85 3
86 1
87 0
88 0
89 0
90 0

List of values

[1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 2, 0, 0, 0, 1, 2, 2, 1, 0, 0, 0, 1, 3, 4, 1, 1, 0, 0, 0, 1, 3, 5, 3, 2, 0, 0, 0, 0, 1, 4, 6, 4, 3, 1, 0, 0, 0, 0, 1, 4, 8, 6, 5, 1, 1, 0, 0, 0, 0, 1, 5, 10, 8, 8, 3, 2, 0, 0, 0, 0, 0, 1, 5, 11, 12, 11, 5, 3, 1, 0, 0, 0, 0]