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.

A238406 Number T(n,k) of partitions of n into k parts such that every i-th smallest part (counted with multiplicity) is different from i; triangle T(n,k), n>=0, 0<=k<=floor((sqrt(9+8*n)-3)/2) read by rows.

Table of values

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

List of values

[1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 3, 0, 1, 3, 1, 0, 1, 4, 3, 0, 1, 4, 4, 0, 1, 5, 6, 0, 1, 5, 7, 0, 1, 6, 9, 1, 0, 1, 6, 11, 4, 0, 1, 7, 13, 7, 0, 1, 7, 15, 11, 0, 1, 8, 18, 15, 0, 1, 8, 20, 19, 0, 1, 9, 23, 25, 1, 0, 1, 9, 26, 30, 5]