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.

A117195 Triangle read by rows: T(n,k) = number of partitions into distinct parts having rank k, 0<=k

Table of values

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

List of values

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