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.

A241093 Number of partitions p of n into distinct parts such that max(p) > 1 + 2*(number of parts of p).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 1
6 1
7 2
8 3
9 4
10 5
11 7
12 8
13 11
14 13
15 17
16 21
17 26
18 31
19 38
20 45
21 54
22 65
23 77
24 92
25 108
26 128
27 149
28 175
29 203
30 237
31 274
32 318
33 366
34 424
35 486
36 559
37 640
38 733
39 836
40 953
41 1084
42 1232
43 1398
44 1583
45 1792
46 2025
47 2286
48 2576
49 2902
50 3262
51 3666
52 4111
53 4610
54 5160
55 5774

List of values

[0, 0, 0, 0, 1, 1, 1, 2, 3, 4, 5, 7, 8, 11, 13, 17, 21, 26, 31, 38, 45, 54, 65, 77, 92, 108, 128, 149, 175, 203, 237, 274, 318, 366, 424, 486, 559, 640, 733, 836, 953, 1084, 1232, 1398, 1583, 1792, 2025, 2286, 2576, 2902, 3262, 3666, 4111, 4610, 5160, 5774]