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.

A268190 Triangle read by rows: T(n,k) (n, k>=1) is the number of partitions of n such that the difference between the two largest distinct parts is k; T(n,0) is the number of partitions of n in which all parts are equal.

Table of values

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

List of values

[1, 2, 2, 1, 3, 1, 1, 2, 3, 1, 1, 4, 3, 2, 1, 1, 2, 6, 3, 2, 1, 1, 4, 7, 5, 2, 2, 1, 1, 3, 11, 5, 5, 2, 2, 1, 1, 4, 13, 10, 5, 4, 2, 2, 1, 1, 2, 20, 11, 8, 5, 4, 2, 2, 1, 1, 6, 23, 16, 10, 8, 4, 4, 2, 2, 1, 1, 2, 33, 20, 15, 9, 8, 4, 4]