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.

A308151 Triangular array: each row partitions the partitions of n into n parts; of which the k-th part is the number of partitions having stay number k-1; see Comments.

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 2, 3, 1, 0, 0, 1, 3, 3, 2, 2, 0, 0, 1, 4, 6, 2, 1, 1, 0, 0, 1, 5, 8, 4, 1, 2, 1, 0, 0, 1, 8, 10, 4, 4, 1, 1, 1, 0, 0, 1, 10, 14, 8, 3, 2, 2, 1, 1, 0, 0, 1, 13, 20, 9, 5, 3, 2, 1, 1, 1, 0, 0, 1, 18, 25, 12, 8, 5, 2]