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.

A304706 Number of partitions (d1,d2,...,dm) of n such that d1/1 > d2/2 > ... > dm/m and 0 < d1 <= d2 <= ... <= dm.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 3
6 4
7 3
8 6
9 5
10 6
11 6
12 8
13 7
14 11
15 10
16 11
17 12
18 15
19 14
20 18
21 17
22 20
23 23
24 27
25 25
26 31
27 32
28 35
29 38
30 43
31 43
32 51
33 54
34 59
35 63
36 71
37 73
38 85
39 89
40 96
41 102
42 113
43 120
44 134
45 141
46 149
47 161
48 175
49 183
50 203
51 213
52 233
53 252
54 280
55 293
56 319
57 338
58 360
59 383
60 409
61 430
62 468
63 493
64 531
65 565

List of values

[1, 1, 2, 2, 3, 3, 4, 3, 6, 5, 6, 6, 8, 7, 11, 10, 11, 12, 15, 14, 18, 17, 20, 23, 27, 25, 31, 32, 35, 38, 43, 43, 51, 54, 59, 63, 71, 73, 85, 89, 96, 102, 113, 120, 134, 141, 149, 161, 175, 183, 203, 213, 233, 252, 280, 293, 319, 338, 360, 383, 409, 430, 468, 493, 531, 565]