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.

A094909 Let p_k(n) = number of partitions of n into exactly k parts; sequence gives p_3(n-3) + p_2(n-2) + 1.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 2
6 4
7 4
8 6
9 7
10 9
11 10
12 13
13 14
14 17
15 19
16 22
17 24
18 28
19 30
20 34
21 37
22 41
23 44
24 49
25 52
26 57
27 61
28 66
29 70
30 76
31 80
32 86
33 91
34 97
35 102
36 109
37 114
38 121
39 127
40 134
41 140
42 148
43 154
44 162
45 169
46 177
47 184
48 193
49 200
50 209
51 217
52 226
53 234
54 244
55 252
56 262
57 271
58 281
59 290
60 301
61 310
62 321

List of values

[1, 1, 1, 1, 2, 2, 4, 4, 6, 7, 9, 10, 13, 14, 17, 19, 22, 24, 28, 30, 34, 37, 41, 44, 49, 52, 57, 61, 66, 70, 76, 80, 86, 91, 97, 102, 109, 114, 121, 127, 134, 140, 148, 154, 162, 169, 177, 184, 193, 200, 209, 217, 226, 234, 244, 252, 262, 271, 281, 290, 301, 310, 321]