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.

A373073 Number of partitions of n such that (smallest part) > 2*(number of parts).

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 2
11 2
12 3
13 3
14 4
15 4
16 5
17 5
18 6
19 6
20 7
21 8
22 9
23 10
24 12
25 13
26 15
27 17
28 19
29 21
30 24
31 26
32 29
33 32
34 35
35 38
36 43
37 46
38 51
39 56
40 62
41 67
42 75
43 81
44 90
45 98
46 108
47 117
48 130
49 140
50 154
51 167
52 183
53 197
54 216
55 233
56 254
57 274
58 298
59 321
60 350
61 376
62 408
63 440
64 477
65 513
66 556
67 598
68 647

List of values

[1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 26, 29, 32, 35, 38, 43, 46, 51, 56, 62, 67, 75, 81, 90, 98, 108, 117, 130, 140, 154, 167, 183, 197, 216, 233, 254, 274, 298, 321, 350, 376, 408, 440, 477, 513, 556, 598, 647]

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

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