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.

A264404 Triangle read by rows: T(n,k) is the number of partitions of n in which the sum of the parts of multiplicity greater than 1 is k (0<=k). For example, in the partition [3,2,2,1,1,1] the sum k is 2 + 1 = 3.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 3, 1, 4, 4, 1, 2, 5, 6, 2, 2, 6, 8, 3, 3, 2, 8, 11, 4, 5, 2, 10, 14, 5, 7, 3, 3, 12, 19, 7, 10, 5, 3, 15, 24, 9, 15, 6, 4, 4, 18, 31, 12, 20, 9, 7, 4, 22, 39, 15, 26, 13, 9, 6, 5, 27, 49, 19, 36, 17, 13, 10, 5, 32, 61, 24, 46, 23, 18, 14, 7, 6, 38, 76, 30, 60, 31, 24]