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.

A096541 Number of parts unequal to 1 in all partitions of the integer n. Also the difference between the labeled and the unlabeled case of one-element transitions from the partitions of n to the partitions of n+1.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 5
5 8
6 16
7 24
8 41
9 61
10 95
11 136
12 204
13 284
14 407
15 560
16 779
17 1050
18 1432
19 1901
20 2543
21 3338
22 4393
23 5698
24 7411
25 9513
26 12226
27 15562
28 19803
29 24993
30 31538
31 39506
32 49456
33 61546
34 76499
35 94603
36 116858
37 143679
38 176431
39 215802
40 263576
41 320796
42 389900

List of values

[0, 0, 1, 2, 5, 8, 16, 24, 41, 61, 95, 136, 204, 284, 407, 560, 779, 1050, 1432, 1901, 2543, 3338, 4393, 5698, 7411, 9513, 12226, 15562, 19803, 24993, 31538, 39506, 49456, 61546, 76499, 94603, 116858, 143679, 176431, 215802, 263576, 320796, 389900]