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.

A099386 Number of partitions of 2*n into distinct minimal numbers.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 1
5 1
6 2
7 1
8 2
9 3
10 2
11 3
12 3
13 2
14 3
15 3
16 2
17 3
18 4
19 3
20 4
21 5
22 3
23 4
24 5
25 3
26 5
27 6
28 4
29 6
30 7
31 5
32 8
33 9
34 6
35 9
36 9
37 6
38 10
39 10
40 8
41 12
42 11
43 9
44 12
45 11
46 9
47 12
48 11
49 9
50 13
51 12
52 10
53 14
54 12
55 10
56 14
57 12
58 11
59 15
60 14
61 13
62 17
63 16
64 14
65 18
66 15
67 13
68 18
69 15

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 4, 3, 4, 5, 3, 4, 5, 3, 5, 6, 4, 6, 7, 5, 8, 9, 6, 9, 9, 6, 10, 10, 8, 12, 11, 9, 12, 11, 9, 12, 11, 9, 13, 12, 10, 14, 12, 10, 14, 12, 11, 15, 14, 13, 17, 16, 14, 18, 15, 13, 18, 15]