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.

A262885 Irregular triangle T(n,k) read by rows: T(n,k) = number of partitions of n into at least two distinct parts, where the largest part is n-k.

Table of values

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

List of values

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