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.

A116595 Triangle read by rows: T(n,k) is the number of partitions of n having exactly k parts that appear exactly once (n>=0, k>=0).

Table of values

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

List of values

[1, 0, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 2, 4, 4, 2, 1, 2, 8, 4, 1, 6, 8, 6, 2, 5, 12, 10, 3, 9, 16, 12, 4, 1, 7, 23, 19, 6, 1, 16, 24, 25, 10, 2, 11, 40, 33, 14, 3, 22, 45, 41, 22, 5, 20, 59, 63, 27, 6, 1, 33, 72, 73, 42, 10, 1, 28, 99, 101, 53, 14, 2, 51, 108, 127, 75, 21, 3, 42, 153, 167]