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.

A264033 Triangle read by rows: T(n,k) (n>=0, 0<=k<=A130519(n+1)) is the number of integer partitions of n having k pairs of different size.

Table of values

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

List of values

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