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.

A241065 Number of partitions p of n into distinct parts such that max(p) < -1 + 2*min(p).

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 2, 4, 3, 3, 4, 5, 4, 5, 5, 6, 6, 7, 7, 8, 8, 8, 10, 11, 10, 12, 12, 13, 14, 15, 16, 17, 19, 18, 20, 22, 22, 25, 26, 27, 29, 30, 32, 34, 36, 37, 41, 43, 44, 47, 50, 51, 55, 58, 60, 65, 68, 70, 75, 78, 82, 85, 91]

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

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