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.

A265250 Number of partitions of n having no parts strictly between the smallest and the largest part (n>=1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 10
7 13
8 17
9 20
10 26
11 29
12 35
13 39
14 48
15 48
16 60
17 61
18 74
19 73
20 87
21 86
22 106
23 99
24 120
25 112
26 140
27 130
28 155
29 143
30 176
31 159
32 194
33 180
34 216
35 186
36 240
37 209
38 258
39 234
40 274
41 243
42 308
43 261
44 325
45 289
46 348
47 297
48 383
49 314
50 392
51 356
52 423
53 355
54 460
55 372
56 468
57 422

List of values

[1, 2, 3, 5, 7, 10, 13, 17, 20, 26, 29, 35, 39, 48, 48, 60, 61, 74, 73, 87, 86, 106, 99, 120, 112, 140, 130, 155, 143, 176, 159, 194, 180, 216, 186, 240, 209, 258, 234, 274, 243, 308, 261, 325, 289, 348, 297, 383, 314, 392, 356, 423, 355, 460, 372, 468, 422]