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.

A241086 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 1
3 1
4 1
5 2
6 2
7 2
8 2
9 3
10 4
11 4
12 5
13 5
14 6
15 7
16 8
17 9
18 11
19 12
20 14
21 15
22 17
23 19
24 21
25 24
26 27
27 31
28 34
29 38
30 42
31 47
32 51
33 57
34 62
35 70
36 77
37 85
38 93
39 104
40 114
41 125
42 137
43 150
44 164
45 180
46 196
47 214
48 234
49 255
50 279
51 304
52 332
53 360
54 393
55 426
56 464
57 502
58 545
59 589
60 640
61 691
62 749

List of values

[0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 5, 5, 6, 7, 8, 9, 11, 12, 14, 15, 17, 19, 21, 24, 27, 31, 34, 38, 42, 47, 51, 57, 62, 70, 77, 85, 93, 104, 114, 125, 137, 150, 164, 180, 196, 214, 234, 255, 279, 304, 332, 360, 393, 426, 464, 502, 545, 589, 640, 691, 749]

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

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