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.

A264402 Triangle read by rows: T(n,k) is the number of partitions of n that have k parts larger than the smallest part (n>=1, k>=0).

Table of values

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

List of values

[1, 2, 2, 1, 3, 2, 2, 4, 1, 4, 5, 2, 2, 8, 4, 1, 4, 9, 7, 2, 3, 12, 10, 4, 1, 4, 14, 15, 7, 2, 2, 17, 20, 12, 4, 1, 6, 18, 27, 17, 7, 2, 2, 23, 33, 26, 12, 4, 1, 4, 24, 44, 35, 19, 7, 2, 4, 27, 51, 49, 28, 12, 4, 1, 5, 30, 64, 63, 41, 19, 7, 2, 2]