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.

A132011 Number of partitions of n into distinct parts such that 3*u<=v for all pairs (u,v) of parts with u

Table of values

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

List of values

[1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 5, 5, 5, 6, 7, 7, 7, 8, 9, 9, 9, 10, 11, 12, 12, 13, 14, 15, 15, 16, 17, 18, 18, 19, 20, 21, 22, 24, 25, 26, 27, 29, 30, 31, 32, 34, 35, 36, 37, 40, 42, 43, 44, 47, 49, 50, 51, 54, 56, 57, 58, 61, 64, 66, 67, 70, 73, 75, 76, 79, 82, 84, 85, 88, 91]