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.

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

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 2
6 1
7 2
8 2
9 2
10 2
11 3
12 3
13 3
14 3
15 4
16 4
17 5
18 4
19 5
20 6
21 6
22 7
23 7
24 7
25 8
26 9
27 10
28 10
29 11
30 11
31 12
32 14
33 14
34 15
35 17
36 17
37 18
38 19
39 20
40 23
41 24
42 25
43 26
44 28
45 29
46 31
47 34
48 35
49 37
50 40
51 42
52 44
53 46
54 48
55 51
56 55
57 58
58 61
59 64
60 67
61 70
62 75
63 77
64 82
65 87
66 90
67 96
68 101
69 105
70 111

List of values

[0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 4, 5, 6, 6, 7, 7, 7, 8, 9, 10, 10, 11, 11, 12, 14, 14, 15, 17, 17, 18, 19, 20, 23, 24, 25, 26, 28, 29, 31, 34, 35, 37, 40, 42, 44, 46, 48, 51, 55, 58, 61, 64, 67, 70, 75, 77, 82, 87, 90, 96, 101, 105, 111]