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.

A241061 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 1
2 1
3 2
4 1
5 2
6 2
7 2
8 2
9 4
10 2
11 3
12 4
13 4
14 4
15 5
16 4
17 6
18 7
19 6
20 6
21 8
22 8
23 9
24 10
25 10
26 10
27 12
28 12
29 14
30 16
31 14
32 16
33 18
34 18
35 20
36 22
37 23
38 24
39 26
40 26
41 28
42 32
43 32
44 35
45 38
46 38
47 40
48 44
49 45
50 48
51 52
52 54
53 58
54 62
55 62
56 66
57 71
58 74
59 78
60 84
61 86
62 92
63 98
64 100
65 106
66 112
67 116
68 122

List of values

[0, 1, 1, 2, 1, 2, 2, 2, 2, 4, 2, 3, 4, 4, 4, 5, 4, 6, 7, 6, 6, 8, 8, 9, 10, 10, 10, 12, 12, 14, 16, 14, 16, 18, 18, 20, 22, 23, 24, 26, 26, 28, 32, 32, 35, 38, 38, 40, 44, 45, 48, 52, 54, 58, 62, 62, 66, 71, 74, 78, 84, 86, 92, 98, 100, 106, 112, 116, 122]

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

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