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.

A121081 Number of partitions of n into parts with at most one 1 and at most one 2.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 3
6 5
7 6
8 8
9 11
10 14
11 18
12 24
13 30
14 38
15 49
16 61
17 76
18 96
19 118
20 146
21 181
22 221
23 270
24 331
25 401
26 486
27 589
28 709
29 852
30 1025
31 1225
32 1463
33 1746
34 2075
35 2463
36 2922
37 3453
38 4077
39 4808
40 5656
41 6644
42 7798
43 9130
44 10678
45 12475
46 14547
47 16942
48 19714
49 22898
50 26570
51 30798

List of values

[1, 1, 2, 2, 3, 5, 6, 8, 11, 14, 18, 24, 30, 38, 49, 61, 76, 96, 118, 146, 181, 221, 270, 331, 401, 486, 589, 709, 852, 1025, 1225, 1463, 1746, 2075, 2463, 2922, 3453, 4077, 4808, 5656, 6644, 7798, 9130, 10678, 12475, 14547, 16942, 19714, 22898, 26570, 30798]