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.

A237979 Number of strict partitions of n such that (least part) > number of parts.

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 1
6 1
7 2
8 2
9 3
10 3
11 4
12 4
13 5
14 5
15 7
16 7
17 9
18 10
19 12
20 13
21 16
22 17
23 20
24 22
25 25
26 28
27 32
28 35
29 40
30 45
31 50
32 56
33 63
34 70
35 78
36 87
37 96
38 107
39 118
40 131
41 144
42 160
43 175
44 194
45 213
46 235
47 257
48 284
49 310
50 342
51 373
52 410
53 447
54 491
55 534
56 585
57 637
58 696
59 756
60 826
61 896
62 977
63 1060
64 1153
65 1250
66 1359
67 1471
68 1597
69 1729
70 1874
71 2026
72 2195
73 2371
74 2565

List of values

[0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 7, 7, 9, 10, 12, 13, 16, 17, 20, 22, 25, 28, 32, 35, 40, 45, 50, 56, 63, 70, 78, 87, 96, 107, 118, 131, 144, 160, 175, 194, 213, 235, 257, 284, 310, 342, 373, 410, 447, 491, 534, 585, 637, 696, 756, 826, 896, 977, 1060, 1153, 1250, 1359, 1471, 1597, 1729, 1874, 2026, 2195, 2371, 2565]