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.

A015716 Triangle read by rows: T(n,k) is the number of partitions of n into distinct parts, one of which is k (1<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 1, 3, 3, 3, 2, 2, 2, 1, 1, 1, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 7, 6, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 8, 7, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1]