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.

A090824 Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts greater than k and not greater than n, 0<=k<=n.

Table of values

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

List of values

[0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 4, 7, 4, 1, 1, 0, 1, 4, 20, 19, 5, 1, 1, 0, 1, 7, 67, 159, 57, 8, 1, 1, 0, 1, 8, 238, 1607, 1163, 157, 9, 1, 1, 0, 1, 12, 868, 20478, 37251, 7546, 387, 13, 1, 1, 0, 1, 14, 3311, 312511, 1749868, 688733, 41377, 895, 16, 1, 1, 0]