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.

A386584 Triangle read by rows where T(n,k) is the number of length k>=0 integer partitions of n having no permutation without any adjacent equal parts (inseparable).

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 2, 1, 1, 1, 0, 0, 1, 0, 2, 1, 2, 1, 1, 0, 0, 0, 1, 2, 2, 2, 2, 1, 1, 0, 0, 1, 0, 3, 2, 4, 2, 2, 1, 1, 0, 0, 0, 0, 3, 2, 4, 3, 3, 2, 1, 1]