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.

A199086 T(n,k) = Number of partitions of n+2k-2 into parts >= k.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 2, 5, 1, 2, 2, 4, 7, 1, 2, 2, 3, 4, 11, 1, 2, 2, 3, 4, 7, 15, 1, 2, 2, 3, 3, 5, 8, 22, 1, 2, 2, 3, 3, 5, 6, 12, 30, 1, 2, 2, 3, 3, 4, 5, 9, 14, 42, 1, 2, 2, 3, 3, 4, 5, 7, 10, 21, 56, 1, 2, 2, 3, 3, 4, 4, 6, 8, 13, 24, 77, 1, 2, 2, 3, 3, 4, 4, 6, 7, 11, 17, 34, 101, 1, 2, 2, 3, 3, 4, 4, 5]