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.

A116932 Number of partitions of n in which each part, with the possible exception of the largest, occurs at least three times.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 3
6 6
7 6
8 9
9 12
10 14
11 16
12 24
13 25
14 32
15 40
16 49
17 56
18 73
19 81
20 102
21 120
22 142
23 162
24 202
25 227
26 270
27 316
28 367
29 419
30 506
31 565
32 663
33 767
34 879
35 998
36 1179
37 1317
38 1517
39 1739
40 1979
41 2232
42 2588
43 2883
44 3295
45 3742
46 4220
47 4737
48 5426
49 6037
50 6828
51 7701
52 8642
53 9651
54 10939

List of values

[1, 2, 2, 3, 3, 6, 6, 9, 12, 14, 16, 24, 25, 32, 40, 49, 56, 73, 81, 102, 120, 142, 162, 202, 227, 270, 316, 367, 419, 506, 565, 663, 767, 879, 998, 1179, 1317, 1517, 1739, 1979, 2232, 2588, 2883, 3295, 3742, 4220, 4737, 5426, 6037, 6828, 7701, 8642, 9651, 10939]