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.

A182977 Total number of parts that are neither the smallest part nor the largest part in all partitions of n.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 2
8 6
9 12
10 22
11 39
12 66
13 103
14 159
15 243
16 352
17 510
18 721
19 1011
20 1391
21 1903
22 2557
23 3436
24 4549
25 5999
26 7824
27 10187
28 13132
29 16886
30 21544
31 27414
32 34657
33 43703
34 54797
35 68558
36 85328
37 105963
38 131028
39 161664
40 198710

List of values

[0, 0, 0, 0, 0, 0, 1, 2, 6, 12, 22, 39, 66, 103, 159, 243, 352, 510, 721, 1011, 1391, 1903, 2557, 3436, 4549, 5999, 7824, 10187, 13132, 16886, 21544, 27414, 34657, 43703, 54797, 68558, 85328, 105963, 131028, 161664, 198710]