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.

A241091 Number of partitions p of n into distinct parts such that max(p) <= 1 + 2*(number of parts of p).

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 1
5 2
6 3
7 3
8 3
9 4
10 5
11 5
12 7
13 7
14 9
15 10
16 11
17 12
18 15
19 16
20 19
21 22
22 24
23 27
24 30
25 34
26 37
27 43
28 47
29 53
30 59
31 66
32 72
33 82
34 88
35 99
36 109
37 120
38 131
39 146
40 160
41 176
42 194
43 212
44 233
45 256
46 279
47 304
48 334
49 362
50 396
51 431
52 471
53 510
54 558
55 604
56 659
57 714
58 776
59 839
60 913
61 985

List of values

[0, 1, 1, 2, 1, 2, 3, 3, 3, 4, 5, 5, 7, 7, 9, 10, 11, 12, 15, 16, 19, 22, 24, 27, 30, 34, 37, 43, 47, 53, 59, 66, 72, 82, 88, 99, 109, 120, 131, 146, 160, 176, 194, 212, 233, 256, 279, 304, 334, 362, 396, 431, 471, 510, 558, 604, 659, 714, 776, 839, 913, 985]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.