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.

A116599 Triangle read by rows: T(n,k) is the number of partitions of n having exactly k parts equal to 2 (n>=0, 0<=k<=floor(n/2)).

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 3, 1, 1, 4, 2, 1, 6, 3, 1, 1, 8, 4, 2, 1, 11, 6, 3, 1, 1, 15, 8, 4, 2, 1, 20, 11, 6, 3, 1, 1, 26, 15, 8, 4, 2, 1, 35, 20, 11, 6, 3, 1, 1, 45, 26, 15, 8, 4, 2, 1, 58, 35, 20, 11, 6, 3, 1, 1, 75, 45, 26, 15, 8, 4, 2, 1, 96, 58, 35, 20, 11, 6, 3, 1, 1, 121, 75, 45, 26, 15, 8, 4, 2, 1]