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.

A241085 Number of partitions p of n into distinct parts such that max(p) < 2*(number of parts of p).

Table of values

n a(n)
0 0
1 1
2 0
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 3
11 2
12 3
13 3
14 4
15 5
16 6
17 6
18 7
19 8
20 8
21 10
22 11
23 13
24 14
25 17
26 18
27 21
28 22
29 25
30 27
31 31
32 33
33 38
34 42
35 47
36 52
37 57
38 63
39 69
40 76
41 82
42 91
43 99
44 109
45 119
46 132
47 142
48 158
49 171
50 188
51 203
52 223
53 240
54 263
55 284
56 309
57 334
58 364
59 393
60 428
61 463
62 501
63 543
64 588

List of values

[0, 1, 0, 1, 1, 1, 1, 1, 2, 2, 3, 2, 3, 3, 4, 5, 6, 6, 7, 8, 8, 10, 11, 13, 14, 17, 18, 21, 22, 25, 27, 31, 33, 38, 42, 47, 52, 57, 63, 69, 76, 82, 91, 99, 109, 119, 132, 142, 158, 171, 188, 203, 223, 240, 263, 284, 309, 334, 364, 393, 428, 463, 501, 543, 588]

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

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